Dynamic streaming plural lattice video coding representations of video

ABSTRACT

A first sequence of pictures may be partitioned into plural representations, each of the plural representations may be encoded independently of each other with a common time base, a first portion of the plural encoded representations may be provided based on a first network condition, the first portion having a first bit-rate, and a second portion of the plural encoded representations may be provided having a second bit-rate different than the first bit-rate, wherein a switch from providing the first portion to providing the second portion is responsive to a second network condition different than the first network condition.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. application Ser. No.12/819,157 filed on Jun. 18, 2010, which claims priority to U.S.Provisional Application No. 61/218,319, filed on Jun. 18, 2009, bothincorporated herein by reference in their entirety.

TECHNICAL FIELD

The present disclosure relates generally to transmitting, receiving,and/or processing video content.

BACKGROUND

Transfer of a video stream over digital networks includes severalaspects, such as video compression and its transmission for varioustypes of communications networks and systems. Some applications requirecontent to adapt to channel bandwidth through the progression of time.Particularly important in such applications is the ability todynamically adapt to the bit-rate of media content in response tochanging network conditions.

BRIEF DESCRIPTION OF THE DRAWINGS

Many aspects of the disclosure can be better understood with referenceto the following drawings. The components in the drawings are notnecessarily to scale, emphasis instead being placed upon clearlyillustrating the principles of the present disclosure. Moreover, in thedrawings, like reference numerals designate corresponding partsthroughout the several views.

FIG. 1A is a block diagram of an example environment in which latticedvideo coding (LVC) systems and methods may be employed.

FIG. 1B is a block diagram that illustrates an example method ofpartitioning input pictures into lattice representations.

FIG. 2 is a block diagram that illustrates one example mechanism forordering and transmitting each lattice representation in successivetransmission intervals.

FIGS. 3A-3B are block diagrams that illustrate one example of spatialordering and outputting among transmission intervals of groups ofpictures or segments.

FIGS. 4A-4B are block diagrams that illustrate one example of temporalordering and outputting among transmission intervals of groups ofpictures or segments.

FIGS. 5A-5D are block diagrams that illustrate one example of spatialand temporal ordering and outputting among transmission intervals ofgroups of pictures or segments.

FIG. 6A is a block diagram that illustrates the progressively decreasingsize of dependent lattice representations from a first to lasttransmission occurring across plural consecutive transmission intervalsfor a given segment.

FIGS. 6B-6C are block diagrams that illustrate different GOPordering/encoding alternatives.

FIGS. 7A-7B are block diagrams that illustrate an example of spatialprediction employed by an embodiment of an encoder.

DESCRIPTION OF EXAMPLE EMBODIMENTS Overview

In one embodiment, a method that partitions a first sequence of picturesinto plural representations, encodes each of the plural representationsindependently of each other with a common time base, provides a firstportion of the plural encoded representations based on a first networkcondition, the first portion having a first bit-rate, and provides asecond portion of the plural encoded representations having a secondbit-rate different than the first bit-rate, wherein a switch fromproviding the first portion to providing the second portion isresponsive to a second network condition different than the firstnetwork condition.

Example Embodiments

Disclosed herein are certain embodiments of lattice video coding (LVC)systems and methods (collectively referred to herein also as LVCsystems) that provide for adaptive streaming and/or burst error immunityin a video distribution network, such as the Internet or othercommunication networks. In general, as and explained further below, suchLVC systems decompose or partition pictures of one or more segments(e.g., groups of pictures or GOPs) of a video stream into N latticerepresentations (also referred to herein as latticed representations,latticed or latticed video representations, representations, or thelike), where each lattice representation comprises a subset of thepixels of the pre-partitioned picture, and where the collective latticerepresentations of a given picture comprises the same number of pixelsas the pre-partitioned picture. Each resulting lattice representationcorresponds to an independently decodable stream (or in someembodiments, dependently decodable streams) that is transmitted in sucha manner as to enable dispersion of the corresponding data, henceresulting in temporal data elasticity and immunity to burst errors.Further, with regard to adaptive streaming, the decomposition of theoriginal video into independently decodable streams of latticerepresentations enables fine-tuning of the bit rate without thenecessity of signaling between a receiver and server while obviating theneed for additional encoding hardware as is common in multi-bit ratestream implementations.

These advantages and/or features, among others, are describedhereinafter in the context of an example subscriber television networkenvironment, with the understanding that other video environments mayalso benefit from certain embodiments of the LVC systems and methods andhence are contemplated to be within the scope of the disclosure. Itshould be understood by one having ordinary skill in the art that,though specifics for one or more embodiments are disclosed herein, suchspecifics as described are not necessarily part of every embodiment.

FIG. 1A is a block diagram of an example environment, a subscribertelevision system or network 100, in which certain embodiments of LVCsystems and/or methods may be implemented. It should be understood byone having ordinary skill in the art, in the context of the presentdisclosure, that the subscriber television network 100 shown in FIG. 1Ais merely illustrative, and should not be construed as implying anylimitations upon the scope of the disclosure. The subscriber televisionnetwork 100 includes a video stream emitter (VSE) 104 (also referred toas a transmitter) coupled over a network 118 to plural receivers 120A,120B. The VSE 104 comprises a video latticer 106 coupled to an encoder108. The encoder 108 comprises video compression logic 110,packetize/serialize (P/S) logic 112, and a container 114. The receivers120A, 120B respectively comprise a stream buffer 122A, 122B, decoder124A, 124B, de-latticer 126A, 126B, and error concealment logic 128A,128B. The decoders 124A and 124B may be embodied in software and/orhardware configured media, such as a media player or a circuit device,respectively. Each of the receivers 120A, 120B are coupled to a displaydevice 130A, 130B, respectively. Since each of the receivers 120A, 120Bare similarly configured in one embodiment, the description that followsfocuses on one of the receivers 120A, with the understanding thatsimilar description applies to receiver 120B. Note that the receiver,video stream emitter, server, gateway, etc. may also be referred toherein as a network device.

The VSE 104 may reside in a headend, hub, node, or other networklocation. The VSE 104 may be coupled in one embodiment to one or moreservers (not shown), or in some embodiments, may be integrated into oneor more servers or other devices. In general, the VSE 104 comprises anapparatus for processing and transmitting visual information. Visualinformation may be any information from an information source such asfrom a camera, scanned from film, or synthetically created to form animage or portion thereof. The terms “visual information” and “imagedata” are employed interchangeably herein. In one embodiment, the VSE104 includes a mechanism for mapping plural matrices onto eachsuccessive picture of the input video signal 102.

The VSE 104 (one is shown, though in some embodiments, plural VSEs maybe employed) delivers various digital services based on an input signal102 received from, for example, local feeds or storage, and/or sourcedvia a provider network upstream of the VSE 104 and processed at thefacility where the VSE resides. The VSE 104 delivers such services toone or more subscribers associated with the receiver 120A, where suchservices may include broadcast television programming, video-on-demand(VoD), pay-per-view, music, Internet access, e-commerce (e.g., onlineshopping), voice-over-IP (VoIP), and/or other telephone or dataservices. Note that the particular arrangement of components of the VSE104 may be re-ordered in some embodiments, and no particular order offunctionality is intended to be implied for all embodiments by theconfiguration shown in FIG. 1A. In addition, functionality of one ormore components of the VSE 104 may be combined in some embodiments in asingle component, or in some embodiments, distributed among two or moreof these or other components residing within and/or outside of the VSE104. The VSE 104 may include various components not shown in FIG. 1A,including, for instance, a forward error correction (FEC) module orlogic. Note that module and logic is used interchangeably herein torefer to hardware and/or software configured (encoded) mediums. In oneembodiment, the VSE 104 includes filtering capabilities. Such filteringcapabilities may include linear, non-linear, or anti-aliasing filteringcapabilities.

The video latticer 106 receives the input (e.g., video) signal 102. Inone embodiment, the input video signal 102 is a digitized anduncompressed video signal that is ingested as a sequence of successivepictures in their temporal display or output order and in accordancewith a digital video or video interface specification. The digital videoor video interface specification may specify use of a pixel clock, apicture format, a number of pictures per second, a pixel format, and/orthe scan or serial order of the pixels of the successive pictures, orother attributes and values. The scan format of the input video maycorrespond to a progressive or interlaced video signal. The resultingingested video signal includes or represents video data. The exactpicture format, number of pictures per second, pixel format, and scanformat of the received video data may be application specific. Differenttypes of video formats may be used for different applications.

The video latticer 106 may be any hardware and/or software device,collection of devices, or other entity that is adapted to subsample,identify, separate, or mark different lattices of a video signal. Thevideo latticer 106 includes circuitry and instructions, which mayinclude one or more software and/or hardware routines for selectivelylatticing the successive pictures of the input video signal, therebyseparating them into different latticed pictures or picture sequences.In the specific embodiment of FIG. 1A, the video latticer 106 sampleseach input picture to obtain smaller latticed pictures. The latticedpictures include pixel information from particular sampling regions,which represent sets of predetermined spatial locations of pixels, wherethe pixels are selected from matrices of each input picture.

For instance, and referring to FIG. 1B, shown is an illustration of anexample latticing mechanism employed by the video latticer 106 and itsoutput to the encoder 108. In this illustration, each picture 132 of theinput video signal 102 is received by the video latticer 106, andsubsampled or logically partitioned by mapping non-overlappingcontiguous 2×2 sampling matrices on the picture 202, where each pixelfrom each 2×2 sampling matrix (or herein, matrix) is assigned to arespective partition, e.g., lattice. For example a first group of pixelsin the top-left matrix includes pixels 00, 01, 10, and 11 (pixels notshown) corresponding respectively to the areas identified in FIG. 1B asNW, NE, SW, and SE. In other words, northwest (NW) pixels (e.g., pixel00) comprise a first lattice, V0, and all of the NW pixels are assignedto a first latticed picture, LP0. All northeast (NE) pixels (e.g., pixel01) comprise a second lattice, V1, and all NE pixels are assigned to asecond latticed picture, LP1. All southwest (SW) pixels (e.g., pixel 10)comprise a third lattice, V2, and all SW pixels are assigned to a thirdlatticed picture, LP2. All southeast (SE) pixels (e.g., pixel 11)comprise a fourth lattice, V3, and all SE pixels are assigned to afourth latticed picture, LP3. Note that the different lattices may bereferred to also herein as SE, SW, NE, NW lattices and correspond torespective latticed video representations, SE, SW, NE, NW, which can beindividually segmented into segments of groups of pictures (GOPs) forprocessing or in alternate embodiments, separately processed andsegmented into GOPs, as explained further below.

Hence, the lattice V0 is assigned every other pixel on every other rowand every other column starting with pixel 00, e.g., V0 is assignedpixels mn, where m and n correspond to the row number and column number,respectively, and are even integers. For V1, m is an even integer and nis an odd integer. For V2, m is an odd integer and n is an even integer.Similarly, for V3, m and n are odd integers. When referring to sequenceof pictures of the input video signal, lattices V0-V3 can be applied tothe successive pictures to obtain four latticed video representationsthat can be processed separately and independently from each other.

Stated differently, a latticed picture (e.g., a subsampled picture)respectively corresponds to the picture that it originated from in theinput video signal 102. The input video signal has a horizontal pictureresolution and vertical picture resolution, ip_H and ip_V, respectively,and a total number of pixels, ip_NP, which is equal to ip_H multipliedby ip_V. Every picture in an LVR has a horizontal picture resolution anda vertical picture resolution, lp_H and lp_V, respectively, such thatlp_H<ip_H and lp_V<ip_V. The number of pixels in the LVR, lp_NP, equalslp_H multiplied by lp_V.

In some embodiments, each successive picture of the input video signal102 is separated into p (e.g., four) different lattices output by thevideo latticer 106. The pixels selected for each of the p latticedpictures are dispersed across a picture in accordance with the mappingof the non-overlapping contiguous n-pixels matrices on the picture. Forexample, in one operational mode where the number (n) of pixels in eachmatrix is four (n=4) and the number (p) of lattice representationsformed from the input video signal 102 is four (p=4), an input picturewith a picture resolution of 640 pixels in the horizontal and 480 pixelsin the vertical is mapped with a 320×240 grid of 2×2 matrices, and thus,the picture is divided into different groups (matrices) of four pixels.Each 2×2 matrix contains four “adjacent” or neighboring pixels per themeaning of adjacency described below. Each pixel in a 2×2 matrix isallocated to one of the four lattices, which are each conveyed via oneof the four lattice representations. Note that a picture may be mappedwith matrices of different sizes and shapes other than 2×2 pixelmatrices without departing from the scope of the present teachings.

A pixel is said to be spatially adjacent, or adjacent, to another pixelif they are positioned directly next to each other, either horizontallyor vertically. In an alternate embodiment, pixels may be also consideredadjacent if diagonally next to each other. For example, two pixels maybe considered adjacent if at least one corner of a first pixel isadjacent to at least one corner of a second pixel.

Each matrix in the mapped two-dimensional grid of non-overlappingcontiguous matrices on an input picture corresponds to a samplingregion, where the sampling region represents the locations of the pixelsof the matrix. The shape of a sampling region corresponding to a mappedmatrix may be square, rectangular, linear, or polygonal. In the presentembodiment, the sampling regions have horizontal and vertical edges asdefined relative to edges of a picture.

Two adjacent mapped matrices separate adjacent pixels located acrosstheir horizontal or vertical edges. In one embodiment, each mappedmatrix in a picture is adjacent to at least one other mapped matrix.Alternatively, each mapped matrix in a picture is adjacent to at leasttwo other different mapped matrices. Alternatively, each mapped matrixin a picture is horizontally adjacent to at least one other mappedmatrix and vertically adjacent to at least one other mapped matrix.Alternatively, each mapped interior matrix in a picture is adjacent toat least four other different mapped matrices. The borders of aninterior matrix do not coincide with or are not adjacent to any portionof a picture's borders.

In one embodiment, all of the mapped matrices onto a picture have thesame shape and size. In an alternative embodiment, alternating mappedmatrices in scan order differ in size, shape, position within a picture,shape and size, shape and position, size and position, or size, shape,and position.

In one embodiment, the mapped matrices onto a picture do not overlap. Inan alternative embodiment, the mapped matrices onto a picture overlap.Hence, mapped matrices may or may not spatially overlap.

Each mapped matrix contains n pixels that are processed by the videolatticer 106 to form p lattices, and, thus, p corresponding latticedpictures. In one embodiment, the number of pixels in a mapped matrixequals the number of lattices (e.g., n=p), and the latticed pictures aresaid to be congruent. In an alternative embodiment, p is less than n,and n/p is an integer, and the p lattices have the same pictureresolution, resulting in p congruent lattice representations which arealso a complete set of lattice representations. That is, the videolatticer 106 may distribute (n/p) pixels from each mapped matrix intoeach of the p lattices.

In yet another embodiment, p is less than n, and n divided by p does notequal an integer number, and at least one of the p lattices has apicture resolution that is different from the respective pictureresolution of the other corresponding latticed pictures. Thus, theresulting lattice representations are non-congruent.

Note that in certain embodiments or implementations, the video latticer106 may include methods or execute instructions for selectivelyadjusting the latticing patterns or mapped matrices employed by thevideo latticer 106 according to one or more predetermined criteria. Forexample, the latticing patterns may be selected so that any data loss ismore easily concealed or disguised based on one or more characteristicsof human perception. For example, humans may not be able to perceive animprovised reconstruction of lost pixel data occurring along a diagonaldirection of pixels in a picture or display screen as easily as they maybe able to perceive lost pixel data occurring horizontally or verticallyacross a display screen. Accordingly, the latticing patterns may beselected to force data losses within a predetermined time interval tooccur in patterns other than horizontal or vertical lines.

The choice of lattice shape, size, and placement location within a givenpicture, the number of lattice representations and their relationships,the length or number of processed latticed pictures in a segment, and/orthe ordering and arrangement of segments in segment distributionintervals (SDIs, explained further below) effects the manner in whichlosses are revealed in a given picture (e.g., horizontal bands, verticalbands, diagonal band, etc.). There are a variety of different losspatterns, the discussion of which is unnecessary for an understanding ofthe disclosed embodiments and hence omitted herein for brevity.

Continuing, one mechanism employed by the video latticer 106 maps apicture or frame (picture and frame used interchangeably throughout thedisclosure) of a video signal with a plurality of matrices or lattices(matrices and lattices used interchangeably throughout the disclosure).For the purposes of the present discussion, a matrix may be any groupingof pixels or data associated therewith. A pixel may include one or morevalues associated with a data point, where a data point may be asmallest displayable element or portion of a video picture. A videopicture may be any collection of data used to facilitate constructing animage or representation thereof.

For instance, the video latticer 106 separates or subsamples a videosignal into plural identifiable lattice representations. Such latticesor lattice representations are not to be confused with the layers of ascalable video coding method, nor are such lattice representations to beconfused with three-dimensional (3D) video since representations(lattice representations) in the present disclosure are borne from oneinput video source, such as provided by a single camera or single cameraangle. Each lattice representations in a set of plural latticerepresentations can be processed independently from each other. Each ofthese latticesis associated with, or “assigned,” pixel data from acorresponding set of pixel locations, also referred to as a “samplingregion,” in each picture of the video signal. Each latticerepresentation represents pixel information from a respective latticedversion of the input video signal, and a respective latticed picture isincluded within a corresponding lattice representation. Each set ofsampled pixel locations providing a distinct latticed picture is said toform a lattice of pixels. The respective latticed pictures originatingfrom the successive pictures of the input video signal constitute thecorresponding lattice representations of the input video signal.

The input video signal 102 to the VSE 104 may include a sequence ofdigitized uncompressed pictures, including video pictures that aremapped, via the video latticer 106, with non-overlapping contiguousmatrices containing n pixels each. For an embodiment in which p=n=4,each pixel of each mapped matrix is strategically assigned to adifferent one of the four parallel lattice representations output by thevideo latticer 106 and then processed by the encoder 108, thecorresponding compressed segments further processed by the P/S logic112. Values of each distributed pixel to a lattice may be altered fromthe corresponding pixel values of the input video signal by filteringcapabilities in video latticer 106.

In an alternative embodiment, a given one of the p latticerepresentations output by the video latticer 106 may include plurallattices. In this case, successive pictures of the input video signalare latticed by allocating unequal number of samples of the samplingmatrix to obtain non-congruent corresponding latticed pictures.

In one embodiment where p=n=4 and where each picture is mapped with atwo-dimensional grid of non-overlapping contiguous 2×2 matrices, a firstlatticed video representation of the four latticed video representationsoutput by the video latticer 106 includes one or more pixels located inupper left portion(s) (northwest, NW) of the set(s) of pixel locationscorresponding to one or more mapped 2×2 matrices. A second latticedvideo representation includes one or more pixels located in upper rightportion(s) (northeast, NE) of the set(s) of pixel locationscorresponding to the mapped 2×2 matrices. A third latticed videorepresentation includes one or more pixels located in lower leftportion(s) (southwest, SW) of the set(s) of pixel locationscorresponding to the mapped 2×2 matrices. A fourth latticed videorepresentation includes one or more pixels located in lower rightportion(s) (southeast, SE) of the set(s) of pixel locationscorresponding to mapped 2×2 matrices. The particular mapping of 2×2matrices are selectively repeated across each successive picture of theinput video signal so that each of the four latticed videorepresentations include a different set of pixels chosen from everyother pixel on every other line of each video picture of the input videosignal.

Note that more or fewer than four pixels and four different lattices maybe employed without departing from the scope of the present teachings.For example, the video latticer 106 may lattice the input video signalinto two (instead of four) latticed video representations (describedbelow), which in one embodiment are output in parallel to the encoder108.

The video latticer 106 provides auxiliary information identifying thearrangement and order of non-corresponding segments in the successiveSDIs of the video stream and of the corresponding segments over psuccessive SDIs of the video stream. The auxiliary information enablesthe receiver 120A to reconstruct the intended output pictures at theirproper output time with information contributed from the decompressedversion of one more corresponding latticed pictures of the receivedsegments in the video stream. The identification of different latticesvia auxiliary information may be implemented via various mechanisms,such as by insertion of specific identifying packets; by selectivelyadding or altering packet headers at the transport stream level, thepacketized elementary stream level, the coded video layer; or by othermechanisms. Alternatively, identification information is provided indata fields in a transport stream's packet header or outside a packetpayload. In another embodiment, the identification information isprovided in data fields in a packetized elementary stream's packetheader or outside the packet payload, wherein the packetized elementarystream is carried in the payloads of transport stream packets. In yetanother embodiment, the identification information is provided in datafields in a packet header or outside a packet payload of a coded videolayer.

Those skilled in the art, in the context of the present disclosure, withaccess to the present teachings may readily implement video latticingand de-latticing to meet the needs of a given implementation withoutdeparting from the scope of the present teachings.

The video latticer 106 may include instructions for separating an inputvideo signal into plural latticed video representations, where eachlatticed video representation corresponds to one or more latticesderived from one or more corresponding sampling regions of the inputvideo signal.

Lattice representations output by the video latticer 106 are provided tothe encoder 108. In one embodiment, the p separated latticerepresentations are provided to the encoder 108 in parallel (e.g., atthe same time) to produce respective processed (e.g., encoded) latticerepresentations. The video compression logic 110 of the encoder 108compresses the lattice representations, hence converting them intorespective processed lattice representations having compressed segments,each corresponding to a predetermined picture output span or apredetermined number of consecutive compressed latticed pictures intransmission order. For instance, in one embodiment, each segmentcorresponding to a respective lattice representation corresponds to aGOP. For purposes of the present discussion, a first of twocorresponding segments (e.g., GOPs) is said to be time shifted relativeto the second segment (e.g., a GOP) corresponding to the second of thetwo corresponding segments when a predetermined number ofnon-corresponding segments are inserted between them in the videostream. Thus, corresponding segments of lattice representations are timeshifted relative to each other to, for instance, facilitate errorconcealment in a received video stream in the event of a loss of videodata for a predetermined data-loss interval.

In one embodiment, the processed lattice representations are provided tothe P/S logic 112 for processing (e.g., arrangement) of the segments foroutput. One implementation involves processing different segmentscontaining one or more of the latticed pictures of one or morerepresentations of the video signal (latticed or latticerepresentations), in time-shifted intervals for the purpose oforchestrating the order of how segments of processed latticed picturesare included in a single video stream. Segments are provided insuccessive segments-distribution intervals (SDIs) of the video streamaccording to a determined order. Each successive SDI contains pluralnon-overlapping segments.

Each latticed picture is obtained by selecting a corresponding pixelfrom each sampling matrix superimposed on the successive pictures of theinput video signal or in an alternate embodiment, by obtaining arepresentative pixel value by processing or filtering information of thepicture based on the location of the corresponding pixel in the samplingmatrix. Each separate sequence of latticed pictures of the input videosignal is a respective independent representation of the video signal ora lattice representation.

The order and organization arrangement of segments in the video streammay be chosen based on the size of the respective segments (e.g., numberof bits for plural compressed latticed pictures in a segment) or thenumber of processed latticed pictures in each segment (e.g., the lengthof each segment), which in turn may be based on the errorcharacteristics of a transmission channel or network, such as the typesand durations of burst errors to which the transmission medium is prone.For instance, segment arrangement and ordering may be according to thesize or amount of time of a transmission channel's predetermineddata-loss interval, which can be expressed as a range of values. Forinstance, the range of values may be larger than approximately 500milliseconds and less than approximately 2 seconds, as one exampleimplementation among others. One having ordinary skill in the art shouldappreciate within the context of the present disclosure that othervalues for the data-loss interval may be employed. A data-loss intervalmay be any time interval during which data in a video stream exhibitserrors, is lost, corrupted, or is otherwise not available. Variousmechanisms may cause data loss in a communications channel or network,including burst errors, signal fades, or other data-loss mechanisms.Alternatively, or additionally, the length of segments may be based onthe desire to reduce the amount of time for a random access operation ora channel change operation, or when targeting to reduce the amount oftime in these operations when experiencing an impairment or error.

Each lattice representation may be processed into a respective sequenceof processed latticed pictures, such as a sequence of compressedlatticed pictures, herein also referred to as a processed latticerepresentation. Prior to processing and/or compression, each latticerepresentation may be segmented into sequential non-overlapping segmentsof latticed pictures. Alternatively, each lattice representation may beprocessed and thereafter each processed lattice representation may besegmented into segments of processed latticed pictures. In respectiveembodiments, segmentation may be effected prior to, while, or afterprocessing a lattice representation. The arrangement and ordering ofsegments from multiple lattice representations or processed latticerepresentations into successive non-overlapping SDIs in the video streamis performed prior to transmission.

In one embodiment, each respective processed (e.g., compressed) latticerepresentations is segmented into non-overlapping contiguous segments ofcompressed latticed pictures (e.g., processed latticed pictures). Eachsegment includes consecutive compressed latticed pictures in atransmission order according to a video coding specification (e.g., theMPEG-2 video coding specification). Accordingly, the consecutivecompressed latticed pictures in the segment are provided innon-overlapping manner in sequential transmission order. Consecutivesegments of a processed lattice representation exhibit the sametransmission order continuity as if the processed lattice representationhad not been segmented.

Each separate sequence of latticed pictures of the input video signal isa respective independent representation of the video signal. In someembodiments, the pictures of each respective lattice representation maybe processed or compressed independently from other latticerepresentations of the input video signal. Each processed latticerepresentation (e.g., each lattice representation in compressed form)may be provided in a single video stream but some, and possibly all, ofits consecutive segments can be separated by one or more segments ofother processed lattice representation in the video stream. In oneembodiment, all consecutive segments of a first processed latticerepresentation are provided in a single video stream in their sequentialorder but separated by at least one segment of a different processedlattice representation. In another embodiment, the successive segmentsof the first processed lattice representation in the video stream areseparated by a plurality of segments, each respectively corresponding toa different processed lattice representation. In yet another embodiment,for a complete set of lattice representations (as explained furtherbelow), the successive segments of each processed lattice representationare provided in the video stream separated by a plurality of segments,each provided separating segment respectively corresponding to one ofthe other processed lattice representations of the complete set oflattice representations.

Segments of one or more processed lattice representations may bereceived in a video stream by the receiver 120A. In one embodiment, allsegments of a first processed lattice representation are received andseparated by one or more segments of other processed latticerepresentations in the video stream. That is, consecutive segments ofthe first processed lattice representation are received with at leastone or more segments of other processed lattice representations betweenthem. In yet another embodiment, for a complete set of latticerepresentations (as defined below), the successive segments of eachprocessed lattice representation are received in the video streamseparated by a plurality of segments, each received separating segmentrespectively corresponding to one of the other processed latticerepresentations of the complete set of lattice representations.Successive segments of respective processed lattice representations maybe separated and extracted at the receiver 120A and coalesced into therespective processed lattice representation to independently decode itscompressed latticed pictures into decompressed form, which can then beoutput as a sequence of pictures in their output order.

In some embodiments one or more (and in one embodiment, all) of thepictures of the input video signal that are designated as non-referencepictures in compressed form are not latticed into plural latticerepresentations, whereas pictures of the input video signal designatedas reference pictures are latticed into plural lattice representations.In such embodiments, each successive SDI in the video stream has aplurality of segments, or (p+nrs) segments, where p is greater than oneand equals the segments containing compressed latticed pictures, and nrsis greater than or equal to one and equals the segments containingcompressed non-reference pictures in the full picture resolution of theinput video signal. Pictures in one or more of the segments (e.g., the psegments) in the successive non-overlapping SDIs of the video streamcontain processed latticed pictures that are of smaller pictureresolution than the resolution of the pictures of the input videosignal, whereas the other one or more segments (e.g., the nrs segments)contain processed pictures that are non-reference pictures and have apicture resolution equal to the resolution of the pictures of the inputvideo signal. Thus, there is a dependence on the compressednon-reference pictures in at least one of the nrs segments in an SDI onone or more compressed reference pictures, each of which is intended tohave full picture resolution by the composition of the respectivedecompressed version of a complete set of p corresponding latticedpictures (as explained further below) in compressed form, and for whicheach of the p compressed latticed pictures is included in the same SDIas the respective p segments of compressed latticed pictures.

Each matrix may have a small number of pixels, n, such as, for example,where n=4, there are 4 pixels in a matrix. Note that in a specificembodiment n=p, where p represents the number of resulting latticerepresentations. Hence, a corresponding p number of latticerepresentations are formed, processed, and their segments ordered insuccessive non-overlapping SDIs of a video stream that is transmittedover a network or channel, as discussed more fully below.

Each segment of a processed lattice representation can include one ormore consecutive processed latticed pictures. A compressed latticedpicture may be any picture to which a compression algorithm or otheroperation has been applied to reduce the number of bits used torepresent the latticed picture. Each of the consecutive processedlatticed pictures in a given processed lattice representationcorresponds to a respective latticed picture that originated or wasderived from a picture of the input video signal.

If two or more latticed pictures originate from the same picture of theinput video signal, they are corresponding latticed pictures. If any ina set of corresponding latticed pictures has a horizontal pictureresolution or vertical picture resolution that is different from any ofthe others in the set, the corresponding latticed pictures are said tobe non-congruent corresponding latticed pictures. Congruentcorresponding latticed pictures have the same picture resolution.Throughout this specification, the term “corresponding latticedpictures” refers to congruent corresponding latticed pictures unlessexpressed otherwise (e.g., as non-congruent corresponding latticedpictures). Congruent or non-congruent processed corresponding latticedpictures are respectively congruent or non-congruent correspondinglatticed pictures in compressed form.

Throughout this specification, reference to corresponding latticedpictures in the context of corresponding latticed pictures that havebeen compressed or processed should be understood as correspondinglatticed pictures in their compressed form (or processed form). Forinstance, reference to any lattice representation received in a receivershould be understood to mean a received processed latticerepresentation. Unless otherwise specified, terminologies used forlatticed pictures similarly apply to them when they become processedlatticed pictures. For instance, corresponding processed latticedpictures are corresponding latticed pictures in processed form.Congruent or non-congruent processed corresponding latticed pictures maybe respectively congruent or non-congruent corresponding latticedpictures in compressed form.

A complete set of corresponding latticed pictures has a collectivenumber of pixels equal to ip_NP, and the composition of the set ofcorresponding latticed pictures forms a picture of resolution ip_H byip_V without performing upscaling or pixel replication operations. Acomplete set of non-congruent corresponding latticed pictures is as acomplete set of corresponding latticed pictures except that at least oneof the corresponding latticed pictures has a picture resolution that isdifferent from at least one of the others in the set of correspondinglatticed pictures. Similar definitions apply to processed latticedpictures since they are just latticed pictures in processed form.

A set of p lattice representations of the input video signal forms acomplete representation set of the input video signal if all of thefollowing are satisfied:

1. For each picture of the input video signal there is a set of pcorresponding latticed pictures;

2. Every set of p corresponding latticed pictures has a collectivenumber of pixels equal to ip_NP; and

3. Composition of every set of p corresponding latticed pictures forms apicture of resolution ip_H by ip_V without performing upscaling or pixelreplication operations.

That is, in a complete set of lattice representations, each successivepicture of the input video signal is latticed into p correspondinglatticed pictures and performing the counter operation of latticing onthe p corresponding latticed pictures, de-latticing, results in areconstructed picture of picture resolution ip_H by ip_V, and that isfully populated with pixels generated from the de-latticing of the pcorresponding latticed pictures, without having to improvise for missingpixel values with upscaling or pixel replication operations. A completeset of non-congruent lattice representations is similar except that eachsuccessive picture of the input video signal is latticed into pnon-congruent corresponding latticed pictures. Unless otherwisespecified, in this specification it should be assumed that eachsuccessive picture of the input video signal is latticed into the same plattice structures.

An independent set of processed lattice representations is one in whicheach of the p processed lattice representations can be independentlydecompressed from the other processed lattice representations in theset. A complete independent set of processed lattice representationsconforms to both the complete set property and the independent setproperty.

A nearly-independent set of processed lattice representations is one inwhich each but one of the processed lattice representations in the setcan be decompressed independently from the other processed latticerepresentations in the set. A complete nearly-independent set ofprocessed lattice representations is a nearly-independent set ofprocessed lattice representations with the completeness set property,thus, producing full picture resolution, ip_H by ip_V, for everypicture.

A partially-independent set of processed lattice representations is onein which not all of the processed lattice representations in the set canbe decompressed independently from the other processed latticerepresentations in the set, but at least two of the processed latticerepresentations in the set can be decompressed independently.

A complete set of p processed lattice representations is said to have Rindependently decodable processed lattice representations if for R<p,each of (p−R) processed lattice representations in the set depends onthe information of at least one or more of the other (p−1) processedlattice representations for its decompression.

For purposes of illustrating a particular embodiment, let picture (k, v)represent the k-th compressed picture in transmission order of a givenprocessed lattice representation, v. For nf (number of pictures) equalto a positive integer, a segment of of consecutive compressed picturesof a first processed lattice representation is said to correspond to asegment of nf consecutive compressed pictures of a second processedlattice representation if for each integer value of k from 1 to nf, therespective k-th compressed pictures in transmission order arecorresponding latticed pictures in compressed form. Similarly, aplurality of segments from respectively corresponding processed latticerepresentations are said to be corresponding segments if all possiblepairing of two of the plurality of segments are corresponding segments.In some embodiments, corresponding segments must have the same number ofpictures, nf, and in transmission order, for each integer value of kfrom 1 to nf, the kth compressed picture in each of the correspondingsegments must be a corresponding picture to the respective kthcompressed picture in each of the other segments. In other words, ifeach successive picture in segments from respective processed latticerepresentations originated from the same pictures of the input videosignal, the segments are corresponding segments.

A complete set of corresponding segments corresponds to a complete setof processed lattice representations. The successive correspondingprocessed latticed pictures (in transmission order) in a complete set ofcorresponding segments are a complete set of corresponding latticedpictures.

Corresponding segments or the segments in a complete set ofcorresponding segments may be separated from each other in a videostream so that a data loss during a given time interval does not corruptall of the processed latticed pictures associated with and originatingfrom the same picture of the input video signal. Consequently, missingor corrupted portions of a compressed latticed picture may be concealedvia various mechanisms, including linear or nonlinear interpolation orpicture upscaling, at the receiver. Hence, this embodiment combineserror correction and error concealment to facilitate resilient robusttransport of video over a lossy channel or network, such as an InternetProtocol (IP) packet-switched network. Certain embodiments discussedherein may be particularly useful in applications involving broadcastingvideo via packet-switched networks, also called over-the-top videotransmission.

The respective segments of processed lattice representations are carriedin a video stream in a determined order and/or organization arrangementin accordance to one or more objectives. In some embodiments, thedetermined order and/or organization arrangement of sequentially orderedsegments is intended for error resiliency purposes. In some embodiments,the ordering and/or organization arrangement of the segments isaccording to the error characteristics of the transmission channeland/or network. In some embodiments, the determined order and/ororganization arrangement of sequentially ordered segments is intended tofacilitate rapid random access or fast channel change time. In yet otherembodiments, the determined order and/or organization arrangement ofsequentially ordered segments is for both error resiliency reasons andfast channel change time (or as random access of the video program).

A segments-distribution interval (SDI) in a video stream is an intervalthat satisfies all of the following:

1. Contains a plurality of sequentially ordered non-overlapping segmentscorresponding to processed video representations of the input videosignal;

2. Contains not more than one picture that originated from the samepicture of the input video signal;

3. Every possible pairing of two consecutive segments in the SDIcorresponds to two different processed video representations of theinput video signal;

4. The picture output span of the SDI, which is the temporal span inoutput order of all the pictures in the SDI, referred to herein as theSDI output span, divided by the number of different processed videorepresentations of the input video signal in the SDI equals an integer;

5. The SDI output span corresponds to a time-contiguous picture outputspan, and over the SDI output span each of the pictures in the SDI isintended to be output in its decompressed form (or as informationderived from its decompressed form) at most once, except for when acorresponding “picture output command or information” received in theSDI conveys to repeat a field of the respective output picture or therespective output picture to fulfill the intended contiguous output ofpictures.

Steps 4 and 5 assume the intended content of the SDI withoutimpairments. Step 2 expresses that each of the processed pictures of thesegments in an SDI originates from a different picture of the inputvideo signal. That is, each compressed picture in the SDI respectivelycorresponds to a picture of the input video signal. As expressed in Step1, the sequentially ordered segments in an SDI are non-overlapping. Inother words, the first portion of information of each successive segmentin the SDI is not provided in the video stream until the information ofthe prior segment is completely provided.

As is well-known in the art, pictures in encoded video streams may beprovided (e.g., transmitted) in a transmission order or decode orderthat differs from their output order (e.g., display order).

A latticed video SDI (LVSDI) is an SDI in which all pictures in the SDIare processed latticed pictures. In other words, an LVSDI in a videostream is an interval that satisfies all of the following:

1. Contains a plurality of sequentially ordered non-overlapping segmentscorresponding to processed lattice representations of the input videosignal;

2. Contains no corresponding processed latticed pictures;

3. Every possible pairing of two consecutive segments in the SDIcorresponds to two different processed lattice representations;

4. The LV SDI output span divided by the number of different processedlattice representations in the LVSDI equals an integer;

5. The LVSDI output span corresponds to a time-contiguous picture outputspan, and over the LVSDI output span each of the latticed pictures inthe LVSDI is intended to be output in its decompressed form (or asinformation derived from its decompressed form) at most once, except forwhen a corresponding “picture output command or information” received inthe LVSDI conveys to repeat a field of the respective output picture orthe respective output picture to fulfill the intended contiguous outputof pictures.

Again, Steps 4 and 5 assume the intended content of the LVSDI withoutimpairments. Step 2 expresses that each of the processed latticedpictures of the segments in an LVSDI originates from a different pictureof the input video signal.

A congruent LVSDI is an LVSDI in which all the pictures in the SDI areprocessed latticed pictures and have the same picture resolution. Anon-congruent LVSDI contains at least one processed latticed picturewith picture resolution that is different from any of the otherprocessed latticed pictures in the LVSDI. Throughout this specification,LVSDI refers to a congruent LVSDI unless expressed otherwise (e.g., as anon-congruent LVSDI).

A completely-represented LVSDI (CRLVSDI) is an LVSDI that contains atleast one segment from each respective processed lattice representationof a complete set of p processed lattice representations. Recall thatthe segments in an LVSDI are non-corresponding segments by definition.

The minimum set of successive CRLVSDIs, MinC, is the minimum number ofcontiguous CRLVSDIs in the video stream to provide the completecorresponding segments for each segment in each CRLVSDI.

In one embodiment, the segments of plural processed latticerepresentations are provided (or received) in a video stream accordingto a first temporal order that specifies a temporal relationship betweenone or more segments, and possibly all of the segments, included in eachsuccessive SDI in the video stream. In one embodiment, the SDIs are acomplete set of p congruent processed lattice representations and thefirst temporal order specifies the order of the p non-correspondingsegments in each successive LVSDI, which in this case is a CRLVSDI. Asecond temporal order may further specify the order of each set of pcorresponding segments over each set of p successive CRLVSDIs in thevideo stream (i.e., MinC=p).

The encoder 108 outputs the successive compressed latticed picturescorresponding to each of the p lattice representations in accordancewith the syntax and semantics of a video coding specification. In oneembodiment, segments are provided sequentially, where each segmentconsists of plural compressed pictures from the same latticerepresentation. The transmission order of the successive compressedlatticed pictures in a processed lattice representation may or may notequal the display or output order of the pictures. For example, incertain applications, a future reference picture may be required to betransmitted prior to a picture having an earlier display or output time,but that depends on the decoded version of that future reference picturefor its reconstruction. The encoder 108 effects compression of the plattice representations such that, in one embodiment, the relativetransmission order of the successive compressed latticed pictures ineach of the corresponding p processed lattice representations is thesame. However, in the present embodiment, although the relativetransmission order of the processed latticed pictures within each of thep processed lattice representations is the same, as explained below,each set of p corresponding segments is transmitted in accordance with asecond relative temporal order, which is a re-ordered and/ortime-shifted version of the order of contiguous segments.

The compressed segments are provided to the P/S logic 112, whicharranges and orders the segments in a non-overlapping manner over a setof p successive non-overlapping SDIs of the video stream. In oneembodiment, the P/S logic 112 imposes a time shift and ordering of therespective segments of processed lattice representations. Note that afirst latticed picture is said to correspond to a second latticedpicture if they both originated from the same picture of the input videosignal. Further, corresponding latticed pictures are temporally alignedto the same instance or interval of time for display or output purposessince they originated from the same picture. Depending on theembodiment, the sequentializing (including ordering and/ortime-shifting) of latticed pictures or video segments may occur before,during, or after their compression. The P/S logic 112 may be anyhardware and/or software device, collection of devices, or other entitythat is adapted to sequentialize (order/arrange and/or time-shift)consecutive segments of each of p plural processed latticerepresentations in non-overlapping manner within each successive SDI ofthe video stream and arrange them across successive SDIs as previouslydescribed. The P/S logic 112, in sequentializing the segments, mayindirectly impose a time shift effect, whereby one or more of the pluralsegments of the different processed lattice representations are shiftedin time (or otherwise) with respect to one or more other segments in thevideo stream.

The arrangement and ordering of the segments comprises of ordering pnon-corresponding segments consecutively (and in a non-overlappingmanner) in each of the p successive non-overlapping SDIs, and byseparating each set of p corresponding segments into the respective setof p successive non-overlapping SDIs. The separation imposes a timedelay among corresponding segments in the video stream due to the factthat they are interspersed by non-corresponding segments. Thearrangement and ordering operation of p multiplied by p segments (e.g.,16 segments when p=4) in P/S logic 112 is further according tosatisfying all of the following:

(1) Arranging the p non-corresponding segments in each of the psuccessive non-overlapping SDIs in a time-continuous order, such thatthere is picture output continuity from the last picture output from anon-corresponding segment in the SDI to the first picture output fromthe successive non-corresponding segment in the SDI;

(2) Arranging p non-corresponding segments as the first segment in eachof the p successive non-overlapping SDIs in time-continuous order, suchthat there is picture output continuity from the last picture outputfrom the first segment in an SDI to the first picture output from thefirst segment in the successive SDI, and all of the p first segments ofthe p successive non-overlapping SDIs are from the same processedlattice representation.

In addition to the above two arrangement and ordering criteria, in oneembodiment, all possible pairings of two consecutive segments providedin the video stream are non-corresponding segments.

An example method for latticing, encoding, and arranging the encoded(processed) lattice representations includes receiving an input videosignal with one or more successive uncompressed pictures; separatingeach of the one or more successive pictures of the input video signalinto a complete set of p corresponding latticed pictures; compressingthe successive latticed pictures of each lattice representation of theresulting complete set of lattice representations to obtain a completeset of processed lattice representations, then segmenting the completeset of processed lattice representations into contiguous non-overlappingcorresponding segments, and then ordering and/or arranging eachsuccessive set of p corresponding segments in each successivenon-overlapping set of p consecutive non-overlapping SDIs in the videostream according to a first temporal order.

In an alternate embodiment, rather than employing the first temporalorder, p non-corresponding segments respectively corresponding to eachof the plural processed lattice representations are arranged in eachsuccessive SDI in the video stream in accordance with the definition ofCRLVSDI (described above), and further in accordance with maintainingcontinuity in picture from each segment in the SDI to the nextnon-overlapping segment in the SDI. That is, the segments are orderedwithin the SDI such that the first picture output from each succeedingsegment in the SDI has a presentation time, or PTS, (e.g., as specifiedin MPEG-2 Transport) immediately after the presentation time (e.g.,output time) of the last picture output from the prior segment in theSDI. The aforementioned ordering of consecutive segments of each of thep processed lattice representations are strategically ordered overconsecutive SDIs but because each SDI contains multiple segments, andeach of the segments do not overlap in the SDI, and consecutive SDIs donot overlap, consecutive segments of the same processed latticerepresentation are separated by segments of other processed latticerepresentations in the video stream. Furthermore, according to thedefinition of SDI, corresponding segments are also separated by segmentsof other processed lattice representations. Thus, segment ordering inthe video stream is performed before transmission aiming to facilitateerror correction and/or error concealment.

Another mechanism sequences (e.g., including ordering) correspondingsegments of plural processed lattice representations of at least aportion of a video program, the sequencing representing anon-multiplexed ordering of segments of plural processed latticerepresentations borne from a video program. These sequenced segments areprovided in the disclosed embodiments in a single video stream to thereceiver 120A. Such a single video stream may be referred to as a singleaggregated video stream or aggregated video stream throughout thisspecification because it includes the aggregated segments of pluralprocessed lattice representations.

Another mechanism employs sequencing of segments according to theproportioned bit allocation of the different picture types or ofpictures of different levels of importance whereby different quantitiesof bits are allocated for different picture types and/or pictures (ofthe same or different picture types) having different relative pictureimportance.

The N LRs are included in the container 114 as one file, program stream,or transport stream, and provided for transmission over the network 118.Note that the encoder 104 is configured to deliver encoded (e.g.,according to one or more of a plurality of different transport and videocoding standards/specifications, such as AVC, MPEG-2, etc.) video.

It is noted that the segments corresponding to each of the p processedlattice representations are sequenced into contiguous non-overlappingSDIs of the video stream such that for all possible pairings of twoconsecutive segments provided in the video stream the start of thesecond of the two successive segments in the video stream is after theproviding the first of the successive segments in full.

In one embodiment, the number of consecutive processed latticed picturesin each segment of each successive set of p corresponding segments isfixed. In an alternative embodiment, the number of consecutive processedlatticed pictures, nf, in two consecutive video segments of a givenaggregated video signal changes from a first number to a second number.The change from a first number of consecutive pictures to a secondnumber of consecutive pictures also occurs for the correspondingsegments of the other p−1 processed latticed video representations.

Note that in some embodiments, the VSE 104 may apply FEC techniques to agiven video stream to be transmitted over the network 118. Applicationof FEC to a video stream may include the correction of lost data orother errors in a video stream using the repair symbols. Such FECprocessing may involve adding redundant data in the form of repairsymbols to the video stream to reduce or eliminate the need toretransmit data in the event of certain types of data loss. The repairsymbols facilitate reconstructing the video stream at a receiver in theevent of data loss. Data may be lost due to noise, differing IP routingconvergence times, Raleigh fading in wireless networks, and so on. FECfunctionality in the VSE 104 adds sufficient repair symbols to eachsegment output as part of the aggregated video stream by the VSE 104 toenable the receivers 120A, 120B to correct for errors or data loss tothe aggregated video stream (or portions thereof) within anFEC-protection time interval, also called an FEC protect window.Generally, the FEC-protection time interval is often relatively smallcompared to a loss-concealment interval implemented by the errorconcealment logic 128 of the receivers 120A, 120B.

For clarity, various well-known components, such as video amplifiers,network cards, routers, Internet Service Providers (ISPs), InternetProtocol SECurity (IPSEC) concentrators, Media GateWays (MGWs), filters,and multiplexers or demultiplexers, and so on, have been omitted fromthe figures. However, those skilled in the art with access to thepresent teachings will know which components to implement and how toimplement them to meet the needs of a given application, and hence oneor more of such devices may be incorporated in some embodiments and arecontemplated to be within the scope of the present disclosure.

The network 118 comprises a bi-directional network, or, in someembodiments, a one-way network, and may include a cable televisionnetwork, a satellite television network, a terrestrial network, an IPnetwork, or a combination of two or more of these networks or othernetworks. Further, network PVR and switched digital video are alsoconsidered within the scope of the disclosure. Generally, the network118 may comprise a single network, or a combination of networks (e.g.,local and/or wide area networks). For instance, the network 118 maycomprise a wired connection or a wireless connection (e.g., satellite,wireless local area network (LAN), etc.), or a combination of both. Inthe case of wired implementations, communications network 118 maycomprise a hybrid-fiber coaxial (HFC) medium, coaxial, optical, twistedpair, etc. Other networks are contemplated to be within the scope of thedisclosure, including networks that use packets incorporated with and/orcompliant to other transport protocols or standards or specifications.

As noted above, the VSE 104 is coupled to the receivers 120A and 120Bvia the network 118. Each receiver may comprise one of many devices or acombination of devices, such as a set-top box, television withcommunication capabilities, mobile devices such as cellular phone,personal digital assistant (PDA), or other computer or computer-baseddevice or system, such as a laptop, personal computer, DVD and/or CDrecorder, among others. Referring to receiver 120A (with similarapplicability to receiver 120B), one embodiment of the receiver 120Acomprises a stream buffer 122A that buffers a suitable length of a videoprogram. In some embodiments, the stream buffer 122A may be omitted. Thereceiver 120A also comprises a decoder 124A that works in associationwith the stream buffer 122A, among other buffers (e.g., compressedpicture buffer, decoded picture buffer) to decode the processed latticerepresentations. The decoded lattice representations are provided to thede-latticer 126A, which assembles the lattice representations into thereconstructed picture from which the lattice representations werederived. The de-latticer 126A is coupled to error concealment logic128A, as explained further below. The decoder 124A may include variousother functionality, including reverse-FEC functionality.

For the purposes of the present discussion, plural processed latticerepresentations are output from the VSE 104 as a single video stream,successively transmitted as portions of video data, such as, but notlimited to, the sequential, non-overlapped compressed latticed pictures.

In one embodiment, plural separate video segments are ordered and/ortime shifted in non-overlapping manner (e.g., sequenced) into a singlevideo stream and then transmitted over a single transmission channel.Auxiliary information may be provided in or associated with the videostream to identify the segments of the respective processed latticerepresentations. The auxiliary information may include informationindicating how decoded versions of compressed latticed pictures are tobe assembled by the de-latticer 126A into the intended full pictureresolution of output pictures.

Auxiliary information in, or associated with, the video stream providesidentification information that conveys spatial relationships of thelattices and the relative temporal order of the segments of theprocessed lattice representations. For purposes of the presentdiscussion, the relative temporal order of segments may specify theactual order of the start, end, or completion of each of the segments insuccessive SDIs, and/or each corresponding processed picture in thevideo stream and may further specify the minimum set of successiveCRLVSDIs. The relative temporal order of segments or pictures is said tobe relative, since they are ordered or positioned for transmission withrespect to each other within SDIs or over a minimum set of successiveSDIs.

The error concealment logic 128A is configured to disguise an impairmentin a video stream, such as omitted data, lost data, impaired data, ordata that has not yet been received by the receiver 120A, or othererrors occurring in the transmission or reception of a video stream.Herein, an impairment refers to omitted data, lost data, impaired data,or data that has not yet been received by a receiver (e.g., receiver120A, 120B, etc.), or to other errors occurring in the transmission orreception of a video stream.

The error concealment logic 128A includes filtering capabilities, suchas linear, non-linear or anti-aliasing filtering capabilities to effectupscaling of a decoded latticed picture. The filtering capabilities inthe error concealment logic 128A may compensate for lost data, impaireddata, or non-received data. For example, filtering capabilities may beemployed to upscale at least a portion of a decoded latticed picture ina first processed lattice representation to conceal an impairment in acorresponding latticed picture. For the purposes of the presentdiscussion, data is said to be upscaled when deriving or replicatingdata to compensate for an impairment of data.

The filtering capabilities in the error concealment logic 128A may beemployed to upscale at least a portion of a decoded version of latticedpicture (k, 1), such as the SW latticed picture, thatspatially-corresponds to the impaired portion of latticed picture (k,2), such as the NE latticed picture. For instance, in reference to FIGS.1A-1B, some or possibly all of the generated pixel values in theupscaled version of a decoded latticed picture (k, 1) are used tocompensate for the corresponding pixels of at least one impaired portionof the decoded version of latticed picture (k, 2) or the whole oflatticed picture (k, 2) if latticed picture (k, 2) was completelyimpaired or undecodable.

In one embodiment, when latticed picture (k, 2) is impaired, a singledecoded non-impaired latticed picture, e.g., latticed picture (k, 1), isupscaled in error concealment logic 128A to compensate for therespective one or more spatially-corresponding impaired portions inlatticed picture (k, 2). Alternatively or in addition, when latticedpicture (k, 2) exhibits one or more partial-picture impairments, one ormore portions of a single decoded non-impaired latticed picture, e.g.,latticed picture (k, 1), are upscaled in error concealment logic 128A tocompensate for the respective spatially-corresponding impaired portionsin latticed picture (k, 2).

In another embodiment, p processed lattice representations andidentification information are received at the receiver 120A. Filteringcapabilities in error concealment logic 128A may be used to upscale thedecoded versions of (p−1) non-impaired corresponding compressed latticedpictures to compensate for one or more impairments in the correspondingp-th compressed latticed picture. For purposes of the presentdiscussion, the respective k-th compressed latticed pictures in each ofp received processed lattice representations are correspondingcompressed latticed pictures. The relative temporal order of the pcorresponding k-th processed (e.g., compressed) latticed pictures isdetermined by the receiver 120A from the received identificationinformation, e.g., auxiliary information, such as a presentation timestamp (PTS). The p corresponding k-th compressed latticed pictures maybe determined by the receiver 120A from the PTS or output orderinformation of the p corresponding compressed latticed pictures (orcorresponding p segments). The corresponding p compressed latticedpictures are decoded by the decoder 124A in accordance with theirrelative temporal order. The spatial relationships of the decodedversions of the p corresponding k-th compressed latticed pictures arealso determined by the receiver 120A from the same receivedidentification information.

In an alternate embodiment, the spatial relationships of the decodedversions of the p corresponding k-th compressed latticed pictures aredetermined by the receiver 120A from additional or different auxiliaryinformation that differs from the received identification informationdescribed above. A composite or assembled output picture of the samespatial resolution as the input video signal 102 to the VSE 104 isformed by the de-latticer 126A in accordance with the spatialrelationships determined from the identification information or from theadditional or different auxiliary information. One or more of the (p−1)corresponding decoded latticed pictures are individually upscaled in theerror concealment logic 128 to compensate for one or more impairments inthe k-th compressed latticed picture of the p-th processed latticerepresentation. Similarly, when two corresponding compressed latticedpictures in the received video stream exhibit impairments, one or moreof the (p−2) corresponding decoded latticed pictures are individuallyupscaled to compensate for the impairments.

In one embodiment, the decoder 124A (or other component) includes areverse FEC module or logic. The reverse FEC module implementsinstructions for repairing certain data loss or corruption occurring inone or more of the segments received from the VSE 104. The certain dataloss or corruption corresponds to data losses or corruption that arewithin a predetermined data-loss interval, referred to herein as the FECprotect window. Existing FEC modules, methods, and techniques may bereadily adapted for use with embodiments discussed herein by thoseskilled in the art without undue experimentation. The first reverse FECmodule of the decoder 124A is further adapted to undue any modificationsto the segments that were initially performed by the FEC module of atransmit chain before the segments were transmitted over the network118. Such modifications can be implemented via altering of data, addingrepair symbols, or a combination of both.

The decoder 124A may include one or more circuits, routines, orinstructions (e.g., in software implementations) for decompressing theaggregated video stream provided by the VSE 104. The instructions (e.g.,coded as a media player program or otherwise) may include an inverse ofthe process used by video-compression and sequentializing functionalityimplemented by the encoder 108. The decoder 124A is further configuredwith one or more bit buffers (not shown). In one embodiment, the decoder124A is configured with a bit buffer (BB) dedicated to each respectiveprocessed lattice representation segment. In some embodiments, a singlebit buffer partitioned for each respective segment (e.g., SE, SW, NE,and NW) may be implemented. The decoder 124A orchestrates the decodingof the buffered segments according to a defined bit buffer managementpolicy, in some embodiments ranging in finite picture fidelity levelsfor the intended output pictures. The range of finite levels of picturefidelity may span from immediate, yet partial resolution decoding tofull resolution decoding after a defined latency, and gradations inbetween, as explained further below.

Decompressed video data streams are then output by the decoder 124A andsubsequently de-latticed by the de-latticer 126A. Receiver 120A includescapabilities and/or instructions for coalescing corresponding segments,processing, and for combining the decompressed corresponding latticedpictures for output in an intended picture resolution. In someembodiments, video de-latticing functionality and decoding functionalitycan be features found in a single module, such as in decoder 124A orother components.

Exact details of mechanisms for reconstructing successive pictures foroutput from sets of p decompressed corresponding latticed picturesreceived in the video stream in compressed form are applicationspecific. In some embodiments, associated auxiliary information such astags or packet headers that identify the processed latticerepresentations (and the relationship of the received correspondingsegments and non-corresponding segments) is used by receiver 120A toproperly process and reconstruct the pictures of the processed latticerepresentations. This identification information, which may be added bythe video latticer 106 and/or encoder 108 may enable one or more of thedecoder 124A or de-latticer 126A to manage the bit buffers, to recombineor coalesce the received segments, associate the received correspondingsegments into each respective processed lattice representation, andassociate time-continuous non-corresponding segments. The two forms ofassociation are used to effect reconstruction of output pictures atnon-decreasing picture fidelity levels.

The error concealment logic 128A includes circuitry and/or instructionsfor concealing any losses in the video stream that were not repaired bythe reverse FEC module of the decoder 124A. Furthermore, sincecorresponding segments are separated by non-corresponding segments inthe video streams, output picture reconstruction is controlled withsuccessively non-decreasing or increasing fidelity levels.

The number of initial pictures, for example, after a channel is changedon a television or set-top terminal or other type of receiver 120A, thatwill have missing data depends on a number of factors, including thesize or length of the segments in the video stream, the number ofsegments in each successive SDI of the video stream, the bit-rate of thevideo stream, and where the initial acquisition of the video stream(e.g., tuning) occurs with respect to the first span of segmentsbelonging to the first received SDI. The output of the error concealmentlogic 128A may be input to another stage of video processing, to adisplay device 130A, to memory, or to another entity.

Various methods for concealing missing or lost information may beemployed by the error concealment logic 128A. For example, in oneimplementation, missing pixel information is estimated via aninterpolation process. The interpolation process may include performinglinear or nonlinear interpolation in a direction across a video picturethat exhibits the least amount of change in color brightness, and/orcombination thereof. Providing missing or corrupted pixel information isa type of upsampling.

Accordingly, the upsampling of missing or corrupted pixels may beperformed by filling in pixels in the direction of decreasing lumaand/or chroma gradients using nonlinear upsampling.

Interpolation may include determining how certain information variesspatially through one or more decompressed corresponding latticedpictures, or temporally through decompressed non-corresponding latticedpictures that have consecutive output times, then continuing tointerpolate pixel information to fill missing pixels in the outputpicture at its intended picture resolution. Various types ofinterpolation are possible. Details for determining values for missingpixel information can be application specific.

Furthermore, while the error concealment logic 128 generally employspixel information associated with a given picture to estimate lost pixelinformation within the picture to be output in its intended pictureresolution, embodiments are not limited thereto. For example, in certainimplementations, pixel information from temporally adjacent pictures maybe employed to further estimate lost pixel information in a givenpicture.

At the receiver 120A, in one embodiment, different bit buffer managementpolicies are implemented based on the buffer structure (e.g., separatebit buffers per respective segments of processed latticed videorepresentations, as explained above, or in some embodiments, a singlebit buffer for the segments corresponding to the collective processedlattice representations). Bit buffer management policies includereliance on the decoded time stamp (DTS), constant bit rateconsiderations, underflow, etc. For instance, in an embodiment utilizinga bit buffer per respective processed latticed representation, one bitbuffer management policy is to allow the bit buffer to reach zero (fastdrain) to enable fast channel change implementations. That is, the ¼size pictures enable a quartering of the initial buffering delay if thebit buffer is allowed to reach zero, although not the only way. In someembodiments, the VSE 104 (e.g., the encoder 108) may provide auxiliaryinformation on buffering rules, such as allowed buffer sizes, etc.

Note that the four processed lattice representations, in one embodiment,are independently decodable. In embodiments where B pictures arerelegated to a single processed lattice representation, then independentdecoding among all processed lattice representations is not available.

When the segments corresponding to the processed lattice representationsare received and buffered at the receiving device (e.g., receiver 120A),one of a plurality of decoding strategies may be implemented. Forinstance, upon tuning to a given channel that contains these segments,the segments corresponding to the SE processed lattice representationsreside in the bit buffer before the segments corresponding to the otherthree latticed video representations, and hence should one strategy beto begin decoding immediately, the resulting displayed sequence ofreconstructed pictures have ¼ resolution (since only the segmentscorresponding to the SE processed lattice representations have beenbuffered). Successive intervals of delay before decoding results inincreased resolution (e.g., ½ resolution if pictures from SE and SWsegments are used, ¾ resolution if pictures corresponding to the SE, SW,and NE segments are used, and full resolution if decoding is delayeduntil all corresponding segments have been buffered). The extent towhether the gradations in resolution are discernible by a viewer dependson the interval of delay. For instance, the longer the interval, themore tolerant to loss due to errors, but the greater the start-uplatency to full-resolution. Some example strategies for implementingdecoding of the segments pertaining to the processed latticerepresentations includes the stages implied above, namely, a frozenimage of ¼ resolution, full motion resolution, and full motion, fullresolution, with gradations in between.

Although the receiver 120A has been described with a few components, onehaving ordinary skill in the art should appreciate that other componentsknown to those having ordinary skill in the art may be included in someembodiments, such as a tuner, processor, volatile and non-volatilememory, video and graphics pipelines and other display and outputprocessing components, among other components.

Note that various couplings between modules (e.g., logic) and groupingsof modules shown in FIG. 1A are for illustrative purposes. Those skilledin the art may employ different couplings and groupings withoutdeparting from the scope of the present teachings. The exact couplingsand order of various logic of FIG. 1A are application specific and maybe readily changed to meet the needs of a given application by thoseskilled in the art without undue experimentation.

It should be understood by one having ordinary skill in the art, in thecontext of the present disclosure, that the subscriber televisionnetwork 100 may comprise additional equipment and/or facilities, such asone or more servers, routers, and/or switches at one or more locationsof the network 100 that process, deliver, and/or forward (e.g., route)various digital (and analog) services to subscribers. In someembodiments, the subscriber television network 100 (or componentsthereof) may further comprise additional components or facilities, suchas QAM and/or QPSK modulators, routers, bridges, Internet ServiceProvider (ISP) facility servers, private servers, on-demand servers,multimedia messaging servers, program guide servers, gateways,multiplexers, and/or transmitters, among other equipment, components,and/or devices well-known to those having ordinary skill in the art.

In one embodiment, the components of an LVC system comprise the VSE 104,the receiver 120A (or receiver 120B), or a combination of the VSE 104and receiver 120A (or 120B). In some embodiments, components of an LVCsystem comprise select components of the VSE 104 or receiver 120A (or120B), and in some embodiments, additional components may be includedwithin an LVC system.

Referring now to FIG. 2, shown is a block diagram that illustrates oneexample mechanism for ordering and transmitting each latticerepresentation in successive transmission intervals. In one embodimentwhere p=4 and complete sets of congruent and independent processedlattice representations are provided in a video stream in successiveCRLVSDIs, and in which successive sets of four CRLVSDIs contain sixteen(16) segments as shown in FIG. 2, start-up latency and the benefits ofordering and arrangement of the segments in the video stream (at the VSE104) can be explained in the context of the decoding and bit-bufferingstrategy illustrated in FIG. 2, which illustrates the reception(tuning-in) and processing (e.g., decoding) of sixteen (16) segments ofprocessed lattice representations, each processed lattice representationof ¼ picture resolution. A repeating pattern for providing the segmentsof each of the respective processed lattice representations results fromapplication of a 2×2 lattice scheme as described above in associationwith FIG. 1B. The symbols SE, SW, NE, and NW refer to the respectiveprocessed lattice representations from which the respective segments(GOPs) are derived, as further indicated by the suffix to each GOPdesignation indicated at the bottom of FIG. 2 (e.g., GOP1 SE referringto a GOP corresponding to the SE processed latticed representation).

As explained above, the processed lattice representations correspond torespective lattice representations of the input video signal. The SEprocessed lattice representation contains ¼^(th) of the pictureinformation (¼ resolution) of the intended resolution of the outputpicture at the decoder 124A, and its processed (e.g., compressed)version is transmitted first in a sequenced, non-overlapping manner inthe aggregated video stream, as described above. Accordingly, therespective GOP (e.g., GOP1 SE, GOP2 SE, GOP3 SE, and GOP4 SE)corresponding to the SE processed lattice representation represents atime-continuous ¼ resolution GOP, with the GOPs pertaining to the otherprocessed latticed representations (e.g., for SW, NE, and NWrespectively) collectively representing the other ¾ resolution. Itshould be noted that a portion of the GOPs are shown, and that furtherGOPs to the left and right (e.g., indicated by dashes at each end) inFIG. 2 are implied. Though not shown, FIG. 2 is to be viewed with theunderstanding that GOPs from the corresponding processed latticerepresentations are the oldest starting at the bottom of FIG. 2 (SE) andproceeding to the youngest (the top of FIG. 2, or NW). “Youngest,” forpurposes of the present discussion, refers to those pictures from theGOPs having the latest picture output span, or largest PTS (e.g., mostadvanced in time). “Oldest,” for purposes of the present discussion,refers to those pictures from the GOPs having the earlier picture outputspan, or least or smallest PTS (e.g., most current).

In FIG. 2, each interval designated respectively as T0, T1, T2, T3, andT4 (T0 and T4 partially shown) is referred to as an SDI, and inparticular, each interval corresponds to a respective CRLVSDI as thoseterms are described above. MinC equals four to obtain a single set ofcomplete corresponding segments. It should be noted that the order ofthe segments in the video stream in each CRLVSDI shown in FIG. 2 is frombottom to top (or oldest to youngest, as discussed further below).GOP4-NW, GOP4-NE, GOP4-SW, and GOP4-SE, which are respectively insegment-distribution intervals T1, T2, T3, and T4 and which correspondto lattice representations NW, NE, SW, and SE, respectively, make upcomplete corresponding segments. At the time GOP4-SE is provided orreceived, the other three corresponding segments are intended to havealready been provided or received (e.g., in receiver 120A of FIG. 1A)and the GOP-4 pictures may be output at full picture resolution (e.g.,the picture resolution of the input video signal). For example, receiver120A can perform decoding in decoder 124A of the four received GOP-4representations and then their de-latticing or composition performed invideo de-latticer 126A. Likewise, complete corresponding segments,GOP3-NW, GOP3-NE, GOP3-SW, and GOP3-SE, are provided in CRLVSDIs T0, T1,T2, and T3, respectively. Thus, in general, the next minimum set ofsuccessive CRLVSDIs overlaps the prior set of successive CRLVSDIs overthe last set's last (p−1) CRLVSDIs, which in FIG. 2, p=4.

In FIG. 2, a sixteen (16), ¼ resolution GOP (e.g., segments) repeatingpattern per every four successive SDIs is shown and their correspondingbit buffer activity, are shown below between symbol “< >”. In oneembodiment, a bit buffer is dedicated to its respective processedlattice representation for a total of four (4) bit buffers, as in thepresent example. The relative time reference, which is denoted by anumber, +N, within parentheses can be described as follows:

GOP1 SE (oldest) (+0) <bit buffer (BB)_SE, remove GOP1, leave nothing>

GOP2 SW (+1) <bit buffer (BB)_SW, remove nothing, leave GOP2>

GOP3 NE (+2) <bit buffer (BB)_NE, remove nothing, leave GOP3>

GOP4 NW (youngest) (+3) <bit buffer (BB)_NW, remove nothing, leaveGOP4>—note that this point is where GOP4 collection begins, representingwhen a GOP begins (¼ resolution).

GOP2 SE (oldest) (+0) <bit buffer (BB)_SE, remove GOP2, leave nothing>

GOP3 SW (+1) <bit buffer (BB)_SW, remove GOP2, leave GOP3>

GOP4 NE (+2) <bit buffer (BB)_NE, remove nothing, leave GOP3,4>

GOPS NW (youngest) (+3) <bit buffer (BB)_NW, remove nothing, leaveGOP4,5>

GOP3 SE (oldest) (+0) <bit buffer (BB)_SE, remove GOP3, leave nothing>

GOP4 SW (+1) <bit buffer (BB)_SW, remove GOP3, leave GOP4>

GOPS NE (+2) <bit buffer (BB)_NE, remove GOP3, leave GOP4,5>

GOP6 NW (youngest) (+3) <bit buffer (BB)_NW, remove nothing, leave GOP4,5,6>

GOP4 SE (oldest) (+0) <bit buffer (BB)_SE, remove GOP4, leavenothing>—note that this point is where GOP4 collection ends,representing when a GOP ends (full resolution).

GOP5 SW (+1) <bit buffer (BB)_SW, remove GOP4, leave GOP5>

GOP6 NE (+2) <bit buffer (BB)_NE, remove GOP4, leave GOP5,6>

GOP7 NW (youngest) (+3) <bit buffer (BB)_NW, remove GOP4, leave GOP5, 6,7>

A GOP is used above and below, for illustrative, non-limiting purposes,as an example segment.

Let DTS be the decode time stamp, PTS be the presentation time stamp,and PCR be the program clock reference or system clock, as specified inthe MPEG-2 Transport specification (ISO/IEC 13818-1). GOPs received atthe beginning of an SDI transmitted from the VSE 104 begin with aninitial buffering delay corresponding to DTS-PCR. Continuing theexample, each subsequent GOP (e.g., GOP2 SW) is sent or transmitted at atime corresponding to DTS-(PCR-“one GOP span”) (e.g., DTS minus (PCRminus a span of one GOP span)), with the next (e.g., GOP3 NE)transmitted at DTS-(PCR-“two GOPs span”), and the next (e.g., GOP4 NW)at DTS-(PCR-“three GOPs span”). The “GOP span” refers to thepresentation span of a GOP. Viewed from a different perspective, andwith reference to FIG. 2, tuning into a given processed latticerepresentations within an SDI imparts a different transmission delay(and receiver-side buffering delay), where the delay is given byDTS-PCR+nSDI, where n=0, 1, 2, etc. For instance, referring to theinterval T1, if one tunes into GOP2 SW, a delay of DTS-PCR+1SDI occursbefore the transmission of GOP2 SE in T2 (e.g., delayed for GOP2 SW inT1). Tuning into T1 at GOP3 NE results in a delay of DTS-PCR+2SDI forthe transmission of GOP3 SE (e.g., delayed for GOP3 SW and GOP3 NE).Similarly, tuning into the same SDI (T1) at GOP4 NW results in a delayof DTS-PCR+3SDI for the transmission of GOP4 SE (e.g., delay of GOP4 SWplus GOP4 NE plus GOP4 NW). Each I picture of each segment has a DTS andPTS that match the corresponding I compressed latticed pictures in theother three corresponding segments. Note that in this embodiment,corresponding latticed pictures are compressed with the same picturetype or similar compression strategy or objective since, at least in oneembodiment, each of the four processed lattice representations areindependent processed lattice representations. Note that in certainembodiments, other mechanisms for acquiring content in the video streammay be used in lieu of a tuner.

After a channel change or a random access operation into the videostream, complete (or full) pictures become available for output no laterthan after the p-th CRLVSDI.

It should be noted in FIG. 2 that upon a channel change or random accessoperation, the video stream can be accessed at the first availableCRLVSDI and decoding can start with the next (e.g., oldest) processedlattice representation (e.g., SE lattice representations), which isreceived when the next CRLVSDI in the video stream starts. In the worstcase, pictures can be output at one p-th (e.g., one fourth in thepresent example) of the full resolution of the input video signal, suchas when accessing or tuning into the video stream while GOP4-NW is beingtransmitted within T1. In such case, pictures corresponding to segmentGOP2-SE in T2 are the first from the processed SE lattice representationto arrive at receiver 120A, and thus they are the first to bedecompressed and output. Since the pictures of GOP2-SE representincomplete picture data, or one-fourth of the full picture resolution ofthe input video signal, the compressed latticed pictures in segment GOP2SE are decompressed and de-latticed and then upsampled with preferredupsampling methods in receiver 120A. GOP3 is processed and outputimmediately after GOP2 processed latticed pictures. Since GOP3-SW isprovided or received prior to its corresponding segment, GOP3-SE, fiftypercent of the information of the intended full picture resolution iscontributed to the output pictures that correspond to GOP3. GOP4 isprocessed and output immediately after GOP3 pictures. Sincecorresponding segments, GOP4-SW and GOP4-NE, are provided or receivedpreviously in the video stream, 75 percent of the pixels of the fullpicture resolution are contributed from each successive set of threecorresponding decompressed latticed pictures to the reconstruction ofoutput pictures that correspond to GOP4. GOP5 can then be output usingpixels from successive sets of four (or p) corresponding decompressedlatticed pictures, and thus, the GOP-5 pictures can be output ascomplete pictures without reliance on upsampling operations to improvisefor missing information.

In the previous example, upon a channel change, the picture fidelityincreases gracefully from one quarter of information provided fromdecompressed processed lattice representation information, and theremainder of the missing pixels in the full resolution picture populatedwith upsampling or pixel replication methods, to half, to three-fourths,to full information provided for picture reconstruction, when noupsampling or pixel replication methods are required from then on.

The GOP2-SE processed latticed pictures, or any single segment of aprocessed lattice representation that is decoded and upsampled foroutput, provide the lowest picture fidelity level among a finite set ofpicture fidelity levels. In this case, there are four (or p) picturefidelity levels that correspond to the percentage of pixels of theintended full resolution of the output picture that are contributed fromdecompressed corresponding latticed pictures. The maximum amount ofpixels results when the complete set of four (or p) decompressedcorresponding latticed pictures are available to populate the intendedfull resolution of the output picture. The lowest picture fidelity levelresults when a single decompressed latticed picture (e.g., 25 percent ofinformation) is available to reconstruct the intended full resolution ofthe output picture. When two or three decompressed correspondinglatticed picture are available, 50 or 75 percent of the information ofthe intended full resolution is contributed to the output picture,respectively.

If accessing or tuning into the video stream transpires while GOP3-NE isbeing transmitted within CRLVSDI T1, GOP2-SE is first output byupsampling one fourth of picture information to the intended outputpicture size. As in the prior example, the progression of improvedpicture fidelity increases by contributing fifty percent of the intendedpixel population of the output pictures corresponding to GOP3. Anotherfifty percent of upsampled pixel information obtained with preferredupsampling methods applied to the contributed fifty percent of populatedinformation result in full resolution output pictures. However, unlikethe prior example, GOP-4 pictures can be output using pixels from thefour (or p) processed lattice representations since they are allavailable for decompression and de-latticing. In this example,full-picture reconstruction is acquired after the third CRLVSDI ratherthan the fourth CRLVSDI. Furthermore, the picture fidelity increasesgracefully from:

1. one quarter of contributed information to the output pictures, withthe remainder of the information in the output GOP-2 pictures obtainedby upsampling, to

2. contributing half of the information to the output pictures, with theremainder of the information in the output GOP-3 pictures obtained byupsampling, to

3. full information contribution for the reconstruction of the output ofGOP4 pictures, when no upsampling or pixel replication methods arerequired from then on.

If accessing or tuning into the video stream transpires while GOP2-SW isbeing transmitted within CRLVSDI T1, as previously discussed, GOP2-SE isfirst output by upsampling one fourth of picture information to theintended picture size. However, the progression of improved picturefidelity increases to 75 percent of intended pixel population in theoutput pictures corresponding to GOP3 since corresponding segmentsGOP3-SE, and GOP3-SW, and GOP3-NE have been provided or received. GOP-4pictures can be output using pixels from the four (or p) processedlattice representations since the complete set of corresponding segmentsare available for decompression and de-latticing. In this example,full-picture reconstruction was acquired on the third CRLVSDI and notover four CRLVSDIs. Furthermore, the picture fidelity increasesgracefully from one quarter of information contribution to the outputpicture, to 75 percent of the information contributed, to full intendedpicture reconstruction without upsampling or pixel replication requiredfrom then on.

If accessing or tuning into the video stream transpires not prior butwhile GOP1-SE is being transmitted within CRLVSDI T1, GOP2-SE is firstoutput but now with 50 percent of the intended pixel information (andthe rest by upsampling information) due to the fact that GOP2-SW wasalready received. The progression of improved picture fidelity increasesto 75 percent of intended pixel population in outputting GOP-3 picturesand then to full pictures when outputting GOP-4 pictures. In thisexample, full-picture reconstruction was acquired again on the thirdCRLVSDI and not over four CRLVSDIs. However, the picture fidelityincreases gracefully from pictures reconstructed from half the amount ofthe intended pixel information for GOP2 pictures, to 75 percent of theintended information for GOP3 pictures, to full intended picturereconstruction for the GOP4 pictures.

As described previously, the segments of processed latticerepresentations are provided in a video stream in sequentialnon-overlapping order rather than multiplexed as a set of pluralstreams. For instance, as shown at the bottom of FIG. 2, GOP2 SE isinserted in the stream, followed by the GOP3 SW, followed by the GOP4NE, followed by the GOP5 NW, and so on over plural consecutive,non-overlapping SDIs (e.g., T2, T3, etc.) in a single video stream, asillustrated at the bottom of FIG. 2. Hence, each respective SDI includesfour segments, or GOPs, ordered within the SDI from the oldest segment(corresponding to the SE processed lattice representation) to theyoungest segment (corresponding to the NW processed latticerepresentation). Such an implementation may also reduce the probabilityof I pictures from multiple processed lattice representations beingaffected by a single correlated data loss event, thus, providing forbetter error concealment.

Continuing with the explanation of the bottom of FIG. 2, shown aresegments in consecutive, non-overlapping order. Each segmentsymbolically represents sixteen (16, though not limited to 16) processedlatticed pictures comprising an example GOP. The first segment (GOPN SE)in each interval (e.g., T1, T2, etc.) represents the oldest GOPpertaining to the SE processed lattice representation. The secondsegment GOPN SW, following after the first GOPN SE, represents thesecond youngest GOP corresponding to the SW processed latticerepresentation. Similarly, a third segment GOPN NE (corresponding to theNE processed lattice representation) follows the second GOPN SW, and afourth segment GOPN NW (corresponding to the NW processed latticerepresentation) follows the third GOPN NE, the fourth GOPN NWrepresenting the youngest GOP. In such a sequential ordering ofsegments, the PCR is a common clock reference to all four segmentsincluded in the given SDI. Each of the segments (GOPs) are separatedand/or respectively extracted, and each segment contains a specifiednumber of processed pictures, the number being equal in each segment inthe SDI in one embodiment, with each segment hence representing the sametime-continuous picture output span (e.g., the same time-contiguous spanof presentation time). For instance, the entire picture output span ofthe four segments in T1 (e.g., the SDI output span), in one example, is½ second, and each SDI output time is divided for the four segments inthe respective SDI, resulting in a ⅛ second time-contiguous pictureoutput spans for each of the segments as shown in FIG. 2. Thus, in oneembodiment, each SDI includes an output picture span of V2 sec as oneexample output picture span. In an alternate embodiment, the outputpicture span of each successive SDI in the video stream is specified bythe number of compressed latticed pictures in the SDI divided by thenumber of segments in the SDI. Note that in some embodiments, the numberof bits in each of those segments is unlikely equal, but instead, thefour picture output spans are equal. That is, an encoder may opt to notappropriate the same amount of bits based on a determined codingstrategy to the respective non-corresponding segments in an SDI.

In one embodiment, each successive set of compressed correspondinglatticed pictures in corresponding segments may further be compressedwith the same picture type, encoding strategy, and/or same level ofrelative picture importance. In other words, if the GOP in the oldestsegment comprises the transmission order sequence I, B, B, B, P, B, B,B, P, B, B, B, P, B, B, B, then the GOP in each of the other threecorresponding segments is of the same sequence. By definition,corresponding latticed pictures have the same output time. Furthermore,in some embodiments, all segments, non-corresponding segments andcorresponding segments, have the same number of compressed latticedpictures, and each successive compressed latticed picture in the segmentis compressed with the same picture type, encoding strategy, and/or samelevel of relative picture importance. In some embodiments, there is a1:1 correspondence in picture importance in corresponding segments. Forinstance, considering each segment to contain an ordered sequence ofcompressed pictures in transmission, the relative importance of the1^(st) picture in the oldest segment is the same as the relativeimportance of the first picture of the second, third, and fourthsegments within the SDI.

Although described using the same quantity of pictures in each of thesegments in an SDI of the video stream, in some embodiments, the numberof compressed pictures in segments may vary per SDI. That is, someimplementations may change the picture output span of the SDI from oneSDI to the next. Implementations that may warrant such changed intervalsinclude personal video recording (PVR) applications, scene changes,splicing (e.g., due to a source change), instantiation of programboundaries, variable field frame encoding, variable repetition rate,and/or different type of programs or presentations (e.g., a high actionor motion scenes, such as car chases, high action programs such assports, and low motion programs such as newscasts).

In some embodiments, the number of processed latticed pictures insegments in “pseudo-SDIs” are different but every p segment in eachpseudo-SDI is part of a complete set of corresponding segments in everyset of p consecutive pseudo-SDIs. Pseudo-SDIs may not satisfy the fourthlisted property of the SDI definition, as discussed above, since thetotal number of pictures in the SDI divided by the number of segments inthe SDI may not equal an integer.

In addition, with regard to audio, typically audio is transmitted offsetfrom video, since video typically has a much longer delay. In oneembodiment, the audio is associated with the oldest segment (e.g., whichis displayed first) of each successive SDI. That is, since the oldestsegment is the first due for decoding and presentation, it representsthe closest stream to current present time. Audio is referenced to thesame common PCR. At the receive side, there is a first compressedpicture slated for decoding and presentation that corresponds toDTS-PCR, and when the PTS for the first picture comes up, the audiocorresponds to having this PTS being ordered in a manner such that audiodue for output is there when the PTS is there.

Variations of the above are contemplated to be within the scope of thedisclosed embodiments. For instance, fewer than four processed latticerepresentations may be implemented, as described further below.

Full B pictures in a single lattice representation has the benefit thatcompression is more efficient, and as the least important pictures, neednot be protected from errors as much as other pictures that propagateinformation through a given interval. Thus, in one embodiment, one ormore (and in one embodiment, all) of the pictures of the input videosignal that are designated as non-reference pictures in compressed formare not latticed into plural lattice representations, whereas picturesof the input video signal designated as reference pictures are latticedinto plural lattice representations. In such embodiments, eachsuccessive SDI in the video stream has a plurality of segments, or(p+nrs) segments, where p is greater than one and equals the segmentscontaining compressed latticed pictures, and nrs is greater than orequal to one and equals the segments containing compressed non-referencepictures in the full picture resolution of the input video signal.Compressed pictures in one or more of the segments (i.e., the psegments) in the successive non-overlapping SDIs of the video streamcontain processed latticed pictures that are of smaller pictureresolution than the resolution of the pictures of the input videosignal, whereas the other one or more segments (i.e., the nrs segments)contain processed pictures that are non-reference pictures and have apicture resolution equal to the resolution of the pictures of the inputvideo signal. Thus, there is a dependence by the compressednon-reference pictures in at least one of the nrs segments in an SDI onone or more compressed reference pictures, each of which is intended tohave full picture resolution by the composition of the respectivedecompressed version of a complete set of p corresponding latticedpictures in compressed form, and for which each of the p compressedlatticed pictures is included in the same SDI as the respective psegments of compressed latticed pictures.

Referring not to FIGS. 3A-3B, shown is an illustration of one exampleembodiment using two lattice representations in the form of top andbottom fields. Using two lattice representations, there is a gain incompression efficiency relative to the four lattice representation caseshown in FIG. 2. That is, in one embodiment, the video latticer 106separates the incoming GOPs associated with the input signal 102 intotwo picture sequences comprising top field pictures and bottom fieldpictures (respectively, top lattice representations and bottom latticerepresentations). The video latticer 106 provides the two latticerepresentations to the video compression logic 110, which encodes thesegments associated with the respective top and bottom latticerepresentations into two separate, independently decodable streams 302and 304 having a common clock (e.g., same time base). As shown,processed top lattice representations corresponding to stream 302comprise GOP1-top, GOP2-top, GOP3-top, GOP4-top, etc. Likewise,processed bottom (btm) lattice representations corresponding to stream304 comprise GOP1-btm, GOP2-btm, GOP3-btm, GOP4-btm, etc. The processedtop and bottom lattice representations are provided to the P/S logic112, which arranges for output the GOPs from the separate streams 302and 304 in alternating manner. For instance, as shown in output stream306, the processed top lattice representations comprising GOP1, GOP2 aretemporally dispersed (e.g., provide temporal data elasticity) in asingle stream from processed top lattice representations comprising GOP3and GOP4, by the insertion in between of the bottom latticerepresentations comprising GOP1 and GOP2. Improvements in burst immunitymay be achieved by lengthening the GOP intervals, or in someembodiments, by increasing the amount of GOPs in each transmissioninterval. Further, it is noted that the same numbered GOPs among therespective lattice representations (e.g., GOP1-top and GOP1-btm) areseparated by at least one intervening GOP (e.g., GOP2-top), henceproviding additional burst error immunity. The time base (previouslyexplained in the four lattice representation case illustrated in FIG. 2for commencement of decoding and output as corresponding to the SElattice representation) corresponds to the second set of GOPs (e.g.,GOP1-btm, GOP2 btm), and not the first set shown in FIG. 3B (e.g., notGOP1-top, GOP2-top). Further, the transmission interval T1 correspondsto the interval corresponding to two GOPs encoded without LVCtechnology. In other words, the first transmission interval T1 comprisesGOP1-top, GOP2-top, GOP1-btm, GOP2-btm.

FIGS. 4A and 4B illustrate another example of a two latticerepresentation case based on odd and even numbered fields. A similartechnique to that described in association with FIGS. 3A-3B may beapplied to arrange the output (transmission) of processed odd and evennumbered pictures. That is, in one embodiment, the video latticer 106separates the incoming GOPs associated with the input signal 102 intotwo picture sequences comprising odd-numbered pictures and even-numberedpictures (respectively, odd lattice representations and even latticerepresentations). The video latticer 106 provides the two latticerepresentations to the video compression logic 110, which encodes thesegments associated with the respective odd and even latticerepresentations into two separate, independently decodable streams 402and 404 having a common clock (e.g., same time base). As shown,processed odd lattice representations corresponding to stream 402comprise GOP1-odd, GOP2-odd, GOP3-odd, GOP4-odd, etc. Likewise,processed even lattice representations corresponding to stream 404comprise GOP1-even, GOP2-even, GOP3-even, GOP4-even, etc. The processedodd and even lattice representations are provided to the P/S logic 112,which arranges for output the GOPs from the separate streams 402 and 404in alternating manner. For instance, as shown in output stream 406, theprocessed odd lattice representations comprising GOP1, GOP2 aretemporally dispersed (e.g., provide temporal data elasticity) in asingle stream from processed even lattice representations comprisingGOP3 and GOP4, by the insertion in between of the even latticerepresentations comprising GOP1 and GOP2. Improvements in burst immunitymay be achieved by lengthening the GOP intervals, or in someembodiments, increasing the amount of GOPs in a given transmissioninterval. Further, it is noted that the same numbered GOPs among therespective lattice representations (e.g., GOP1-odd and GOP1-even) areseparated by at least one intervening GOP (e.g., GOP2-odd), henceproviding additional burst error immunity. The time base (previouslyexplained in the four lattice representation case illustrated in FIG. 2for commencement of decoding and output as corresponding to the SElattice representation) corresponds to the second set of GOPs (e.g.,GOP1-even, GOP2 even), and not the first set shown in FIG. 4B (e.g., notGOP1-odd, GOP2-odd). Further, the transmission interval T1 correspondsto the interval corresponding to two GOPs encoded without LVCtechnology. In other words, the first transmission interval T1 comprisesGOP1-odd, GOP2-odd, GOP1-even, GOP2-even.

FIGS. 5A-5D are block diagrams that illustrate one example of spatial(e.g., top and bottom field pictures) and temporal (odd and evennumbered pictures) ordering and outputting among transmission intervalsGOPs. As shown in FIG. 5A, the video latticer 106 temporally separatesthe received GOPs of the input signal 102 into independently decodableodd and even numbered picture sequences 502 and 504 (two latticerepresentations). The video latticer 106 further spatially separates therespective sequences 502 and 504 into top and bottom field picturesequences, resulting in a total of four lattice representations:top-field, odd numbered picture sequences 506; bottom field,odd-numbered picture sequences 508; top field, even-numbered picturesequences 510; and bottom field, even-numbered picture sequences 512.The four lattice representations are provided to the encoder 108, whichprovides processed lattice representations and arranges the processedlattice representations in the single stream 514. The single stream 514comprises in one transmission interval (corresponding to thetransmission interval of a non-partitioned GOP), T1, a GOP correspondingto each lattice representation in increasing ordered sequence, similarto that described in association with FIG. 2. For instance, in thetransmission interval T1, the sequence consists of GOP1 top-odd, GOP2btm-even, GOP3 btm-odd, GOP4-top even. The transmission interval T2 andso on follows a similar pattern, enabling temporal continuity yetdispersion of successive GOPs of the same lattice representation.

FIG. 5D illustrates one example mechanism for arranging the fourprocessed lattice representations, which is a similar to FIG. 2, andcoincides to the stream 514 shown in FIG. 5C.

FIG. 6A is a block diagram that illustrates dependencies among latticerepresentations. Digressing briefly, in FIG. 2, each of the latticerepresentations are independently decodable, resulting in approximatelyequal-width GOPS as shown at the bottom of FIG. 2. Accordingly, onecompromise in encoding as independently decodable streams is a loss incompression efficiency. By introducing dependencies in the latticestreams, better coding efficiency results since redundancies may beexploited across the respective lattice streams. Now referring to FIG.6A, shown is the manner in which the processed lattice representationsare encoded and then sequenced (e.g., arranged) in a stream for outputfrom the VSE 104. That is, the stream 600 comprises similar GOP numberedordering as shown in FIG. 2, except with differences in bit rate (asrepresented by the difference in size of each GOP). It is noted that theGOP1 SE 602 in FIG. 6A corresponds to the fourth received instance ofthe SE lattice representation as shown in FIG. 2. The last transmittedlattice representative (e.g.,

GOP1 SE) is the smallest of the corresponding lattice representations(e.g., smaller than GOP1 SW, GOP1 NE, GOP1, NW not shown) since itexploits both temporal and spatial redundancies of the prior receivedlattice representations. Conversely, the first transmitted latticerepresentation is expected to be the largest of the correspondinglattice representations. For instance, it is noted that GOP4 NW 604 inFIG. 6A corresponds to GOP4 NW in FIG. 2, which is the first received(or first transmitted) corresponding lattice representation of the fourlattice representations (e.g., received prior to GOP4 NE, GOP4 SW, GOP4SE). Similarly, note that GOP4 SE 606, the last received of thecorresponding lattice representations (e.g., GOP4 SW, GOP4 NE, GOP4 NW),is even thinner than the corresponding lattice representations due totemporal and/or spatial dependencies exploited during the encoding ofthe in its decoding from one or more of the corresponding latticerepresentations. FIGS. 6B-6C are block diagrams that illustratedifferent GOP ordering/encoding alternatives.

FIGS. 7A-7B are block diagrams that illustrate an example of spatialprediction employed by an embodiment of an encoder 108 (e.g., the videocompression logic 110). In FIG. 7A, a picture 700 is partially shown,partitioned by the video latticer 106 into respective lattices (e.g.,NW, NE, SW, SE) and then separated into respective latticerepresentations as shown in FIG. 7B as NW lattice representation 702, NElattice representation 704, SW lattice representation 706, and SElattice representation 708 (each partially shown). The arrows 710-714represent the various spatial predictions that may be employed by thecompression engine 110. For instance, the compression engine 110 maycomprise motion estimation logic embedded therein (and the receiverdecoder 124A may comprise motion compensation logic to reverse theoperations of the motion estimation logic), such motion estimation logicenabling intra-prediction or spatial prediction among the differentlattice representations of the same picture. For instance, referring toFIG. 7B, the transmission order expected to be produced by the encoder108 comprises NW, NE, SW, SE. Further, the NE lattice representation 704is intra-predicted from the NW lattice representation 702 (and motionestimated from all four lattice representations), as signified by arrow710. Further, the SW lattice representation 706 is intra-predicted fromthe NW 702 and NE 704 lattice representations (and motion estimated fromall four lattice representations), as signified by the arrows 712B and712A, respectively. Also, the SE lattice representation 708 isintra-predicted from the NW 702, NE 704, and SW 706 latticerepresentations (and motion estimated from all four latticerepresentations), as signified by the arrows 714C, 714A, and 714B,respectively. In effect, it is a spatial vector that enables theprediction at a macroblock level, with low overhead (e.g., relative toAVC intra-prediction for Intra-coded or I pictures) to accomplish theresults. In other words, at a macroblock level, decision may be made asto whether uni- or bi-prediction is to be employed. rather thanimplementing on a pixel-by-pixel basis, the different latticerepresentations can be considered as separate.

In view of the above described embodiments, it should be appreciatedthat certain embodiments of LVC systems may implement dynamic oradaptive streaming. For instance, certain embodiments of LVC systemsprovide for plural lattice representations, where each latticerepresentation exhibits approximately the same bit rate (hence, fidelitycontrol is approximately linear). In one or more embodiments disclosedherein, dynamic streaming encompasses providing audio-visual contentfrom a server (e.g., housing functionality of the VSE 104, or coupledthereto) to the receiver 120A, which in one embodiment may be embodiedas a personal computer 140, through the Internet connectivity of thereceiver 120A. In one embodiment, the receiver 120A comprises a mediaplayer that includes audio and video decompression capabilities.Adaptive streaming is emitted from the server. The server seamlesslyswitches between different bit-rate versions of a single video stream bydiscarding (in the case of bit-rate reduction) or aggregating (in thecase of bit-rate increase) one or more latticed representations of thevideo content. N latticed representations are included in a container114, which includes a file, program stream, or transport stream. Thereceiver's video decoder 124A smoothly adapts to the bit-rate changes inaccordance with the amount of data provided by the server, while thereceiver 120A continues to process pictures (e.g., decode, reconstructand output pictures) of the video content that are made of one or morelatticed representations of the video content but in which all possiblelatticed representations of the video (e.g., compressed latticedrepresentations of video) share the same time base. The bit-rate variesaccording to network conditions or available bandwidth available fromserver to receiver 120A, which for instance, may be impacted through oneor more gateways, routers or switches. The bit-rate may also be variedby the server to accordingly satisfy receiver throughput capabilities ordecode capabilities, or according to a dynamically changing processingload or amount of resources in the receiver (such as available processoror media processor capabilities or resources, otherwise also referred toherein as network conditions).

The switch between two different bit-rates of the video content occursby discarding or adding portions of one or more latticed representationswithout interrupting video decoding, reconstruction and presentation tothe viewer. The receiver 120A continues to process the video contentirrespective of its bit-rate.

The bit-rate of latticed representations of video targets availablebandwidth to receiver 120A. Bandwidth may vary in accordance bandwidthconsumption locally (e.g., within a home or premise) or within the localarea network, or the geographical location or community's consumption(individually or collectively also referred to herein as networkconditions). Dynamic streaming using certain LVC embodiments switchesseamlessly to a higher- or lower-quality bit-rate based on availablebandwidth without ever disrupting the flow of video or audio.

The receiver 120A (or media player running in the receiver) may employtechniques such as buffer fullness (e.g., detected in association withthe stream buffer 122A), data arrival, and their respective relation toa time base (such as PCRs specified in MPEG-2 systems) to monitorcurrent bandwidth from the server to receiver 120A. Depending on thestatus of these monitored parameters, the receiver 120A may signal tothe server its status to accordingly cause a bit-rate change.

Thus adaptive bit-rate and picture fidelity during playback of videocontent may vary according to available bandwidth from server toreceiver 120A and based on a receiver's throughput capability.

The server may use auxiliary information, such as provided metadata (oran alternate strategy or method), that conveys how to dynamically mapthe required bit-rate for different intervals of times based on thenumber of latticed representations in a video stream (or video content)and based on the number of versions of the same content, each includingplural latticed representations. The strategy or method used to manageand provide adaptive bit-rates of the video content may change accordingto the original picture resolution of the video content, the frame rateof the original picture (or uncompressed video), and/or on whether thevideo content is of progressive scan or interlaced scan format.

GOPs of latticed representations may be of a certain length in time ornumber of pictures. For instance, they may be five (5) seconds long or150 pictures in length, as one non-limiting example. In one embodiment,bit-rate adjustment may be at the start of a GOP of one or more latticedrepresentations. In some embodiments, it may be at a finer granularity(e.g., as opposed to quantum bit-rate levels) such as a picture levelsince certain embodiments of LVC systems and methods do not require thatit be done at GOP boundaries or a RAP (entry points into the stream)since all plural latticed representations share the same time base(system clock). Discardable pictures may be removed from one or morelatticed representations to reduce the bit-rate, or in some embodiments,included (if previously removed) to increase the bit-rate.

Whereas in certain implementations, such as multi-bit rate streams(MBRS), it is required to maintain a certain buffer level to switchbit-rates, switching with certain LVC embodiments is transparent bydiscarding or adding pictures within latticed representations at thepicture level or the GOP level by discarding (bit rate reduction) oradding (increasing bit rate) one or more full GOPs of one or morelatticed representations. This flexibility to adapting bit-rate changesat a granularity within a GOP of a latticed representation is attributedto the independent decodability of the lattice representations. In oneembodiment of LVC systems, for adaptive streaming, the GOPs are of equalsize.

As an illustrative example, assume a GOP comprising I, P, and Bpictures, with the relative picture size of I:P:B comprising 15x, 5x,and 1x, respectively. Further, assume a one (1) second GOP with one Ipicture, nine P pictures, and 20 B pictures, and a rate of thirty (30)pictures per second. If the bit rate is 5.5 Mbs, and four (4) latticerepresentations are implemented, the respective bit rates in oneimplementation are 2, 1.5, 1, and 1. Then, 1(15x)+9(5x)+20(1x)=80x,where x is the bandwidth factor within each lattice representation. Witha common time base, adaptive streaming may be achieved by dropping x*nof B pictures from SE, SW, and NE lattice representations.

Note that certain LVC embodiments discussed herein are not limited to aparticular video format. Different video formats may employ differentencoders and decoders. Furthermore, certain LVC embodiments are notlimited to video data transmission, as similar concepts discussed hereinmay be employed for robust transport of audio data or other types ofdata. Those skilled in the art with access to the present teachings mayreadily modify the modules or logic of the disclosed LVC systems to meetthe needs of a given implementation without undue experimentation.

While certain embodiments discussed herein are discussed primarily withrespect to the processing and transport of video data, embodiments arenot limited thereto. For example, other types of data, such as audiodata, text, or other types of data may be latticed, ordered and/or timeshifted, and transmitted in accordance with the present teachingswithout departing from the scope thereof

While certain embodiments disclosed herein have has been discussed withrespect to creation of four latticed video representations from an inputvideo signal, embodiments are not limited thereto.

Although a process of the present disclosure may be presented as asingle entity, such as software, instructions, or routines executing ona single machine, such software, instructions, or routines can readilybe executed on multiple machines. That is, there may be multipleinstances of a given software program, a single program may be executingon two or more processors in a distributed processing environment, partsof a single program may be executing on different physical machines,etc. Furthermore, two different programs can be executing in a singlemachine, or in different machines.

Although the LVC systems and methods have been discussed with respect tospecific embodiments thereof, these embodiments are merely illustrative,and not restrictive, of the LV systems and methods. Embodiments of thepresent disclosure can operate between any two processes or entitiesincluding users, devices, functional systems, or combinations ofhardware and software. For example, while latticing has been describedherein as operating primarily upon video pictures, other portions,arrangements or groupings of video can be subjected to latticing. Forexample, groups of pictures (GOPs), pictures, frames, or other layers orportions of video content may be subjected to latticing.

Any suitable programming language can be used to implement the routinesor other instructions employed by various network entities. Exampleprogramming languages include C, C++, Java, assembly language, etc.Different programming techniques can be employed such as procedural orobject oriented. The routines can execute on a single processing deviceor multiple processors. The routines can operate in an operating systemenvironment or as stand-alone routines occupying all, or a substantialpart, of the system processing.

In the description herein, numerous specific details are provided, suchas examples of components and/or methods, to provide a thoroughunderstanding of embodiments of the present disclosure. One skilled inthe relevant art will recognize, however, that an embodiment of thedisclosure can be practiced without one or more of the specific details,or with other apparatus, systems, assemblies, methods, components,materials, parts, and/or the like. In other instances, well-knownstructures, materials, or operations are not specifically shown ordescribed in detail to avoid obscuring aspects of embodiments of thepresent disclosure.

A “processor” or “process” includes any hardware and/or software system,mechanism or component that processes data, signals or otherinformation. The VSE 104 and/or receivers 120A, 120B may include one ormore processors executing logic (e.g., software encoded on a tangiblecomputer readable medium), and such processor(s) may include ageneral-purpose central processing unit, multiple processing units,dedicated circuitry for achieving functionality, or other systems.Processing need not be limited to a geographic location, or havetemporal limitations. For example, a processor can perform its functionsin “real time,” “offline,” in a “batch mode,” etc. Portions ofprocessing can be performed at different times and at differentlocations, by different (or the same) processing systems. A computer maybe any processor in communication with a memory.

Reference throughout this specification to “one embodiment”, “anembodiment”, “a specific embodiment”, of “an implementation” means thata particular feature, structure, or characteristic described inconnection with the embodiment is included in at least one embodiment ofthe present disclosure and not necessarily in all embodiments. Thus,respective appearances of the phrases “in one embodiment”, “in anembodiment”, or “in a specific embodiment” in various places throughoutthis specification are not necessarily referring to the same embodiment.Furthermore, the particular features, structures, or characteristics ofany specific embodiment of the present disclosure may be combined in anysuitable manner with one or more other embodiments. It is to beunderstood that other variations and modifications of the embodiments ofthe present disclosure described and illustrated herein are possible inlight of the teachings herein and are to be considered as part of thespirit and scope of the present disclosure.

Certain LVC system embodiments of the disclosure may be implemented inwhole or in part by using a programmed general purpose digital computer;by using application specific integrated circuits, programmable logicdevices, field programmable gate arrays, optical, chemical, biological,quantum or nanoengineered systems or mechanisms; and so on. Distributedor networked systems, components, and/or circuits can be used.Communication, or transfer of data, may be achieved via wired, wireless,or by any other means.

It should also be appreciated that one or more of the elements depictedin the drawings/figures can also be implemented in a more separated orintegrated manner, or even removed or rendered as inoperable in certaincases, as is useful in accordance with a particular application. It isalso within the spirit and scope of the present disclosure to implementa program or code that can be stored in a computer-readable storagemedium or device to permit a computing system to perform any of themethods described above.

Additionally, any signal arrows in the drawings/figures should beconsidered only as examples, and not limiting, unless otherwisespecifically noted. For example, an arrow on a signal path indicatingcommunication in one direction does not necessitate that communicationalong that signal path is limited to that one direction.

Furthermore, the term “or” as used herein is generally intended to mean“and/or” unless otherwise indicated. In addition, the term “includes” istaken to mean “includes but is not limited to.” Combinations ofcomponents or steps will also be considered as being noted, whereterminology is foreseen as rendering the ability to separate or combineis unclear.

As used in the description herein and throughout the claims that follow“a”, “an”, and “the” include plural references unless the contextclearly dictates otherwise. Furthermore, as used in the descriptionherein and throughout the claims that follow, the meaning of “in”includes “in” and “on” unless the context clearly dictates otherwise.

The foregoing description of illustrated embodiments of the presentdisclosure, including what is described in the Abstract, is not intendedto be exhaustive or to limit the disclosure to the precise formsdisclosed herein. While specific embodiments of, and examples for, thedisclosure are described herein for illustrative purposes only, variousequivalent modifications are possible within the spirit and scope of thepresent disclosure, as those skilled in the relevant art will recognizeand appreciate. As indicated, these modifications may be made to thepresent disclosure in light of the foregoing description of illustratedembodiments.

Thus, while the present disclosure has been described herein withreference to particular embodiments thereof, a latitude of modification,various changes and substitutions are intended in the foregoingdisclosures, and it will be appreciated that in some instances somefeatures of embodiments of the disclosure will be employed without acorresponding use of other features without departing from the scope ofthe disclosure. Therefore, many modifications may be made to adapt aparticular situation or material to the essential scope of the presentdisclosure. It is intended that the disclosure not be limited to theparticular terms used in following claims and/or to the particularembodiment disclosed as the best mode contemplated for carrying out thisdisclosure, but that the disclosure will include any and all embodimentsand equivalents falling within the scope of the appended claims.

At least the following is claimed:
 1. A method, comprising: encodingplural representations having a respective sequence of latticedpictures, wherein a first sequence of pictures has plural contiguous,non-overlapping segments, each of the plural segments having a singlecorresponding segment in each of the plural representations; decodingthe latticed pictures of a first segment of the plural encodedrepresentations; forming pictures by de-latticing the decodedlatticed-pictures of the first segment; and displaying the de-latticedpictures of the first segment picture at a resolution corresponding to apicture resolution of 1/p, where p equals the number of plural segments.2. The method of claim 1, further comprising providing a first portionof the plural encoded representations based on a first networkcondition.
 3. The method of claim 1, further comprising providing asecond portion of the plural encoded representations based on a secondnetwork condition.
 4. The method of claim 3 wherein the second networkcondition comprises a change in network bandwidth.
 5. The method ofclaim 3, wherein the second network condition comprises a change innetwork device resources.
 6. The method of claim 1, further comprisingproviding the latticed pictures of the first segment of the pluralencoded representations to a server.
 7. The method of claim 1, furthercomprising providing the latticed pictures of the first segment of theplural encoded representations to a network storage device.
 8. Themethod of claim 1, further comprising providing the latticed pictures ofthe first segment of the plural encoded representations over an Internetconnection to a receiver.
 9. The method of claim 8, wherein theproviding the latticed pictures is based on discarding one or more ofthe plural encoded representations without manifesting an interruptionin a presentation of the latticed pictures to a viewer associated withthe receiver.
 10. The method of claim 8, wherein the providing thelatticed pictures is based on aggregating one or more of the pluralencoded representations without manifesting an interruption in apresentation of the latticed pictures to a viewer associated with thereceiver.
 11. The method of claim 8, wherein the providing of thelatticed pictures is further responsive to a signal from the receiver.12. The method of claim 1, wherein the providing of the latticedpictures is implemented at a location different from a random accesspoint (RAP).
 13. A method, comprising: transmitting from a networkdevice a first portion of plural encoded representations having arespective sequence of latticed pictures based on a first networkcondition, the plural encoded representations corresponding to a pluralrepresentations derived from a first sequence of pictures, the firstsequence of pictures having plural contiguous, non-overlapping segments,each of the plural segments having a single corresponding segment ineach of the plural representations, wherein transmitting at the networkdevice a second portion of the encoded plural representations having arespective sequence of latticed pictures based on a second networkcondition; and switching from transmitting the first portion totransmitting the second portion responsive to the second networkcondition being different than the first network condition, whereinpictures may be formed by de-latticing the decoded latticed-pictures fordisplay at a resolution corresponding to a picture resolution of 1/p,where p equals the number of plural segments.
 14. The method of claim13, wherein either the first or second network conditions comprise achange in network bandwidth, a change in available resources of thenetwork device, or a combination of both.
 15. The method of claim 13,wherein the transmitting the respective sequence of latticed picturescomprises transmitting over an Internet connection.
 16. The method ofclaim 13, wherein the second portion differs from the first portion inthe number of encoded plural representations.
 17. The method of claim13, further comprising monitoring by the network device one or moreparameters, and responsive to a change in status of the one or moreparameters, signaling to a server to switch from transmitting the firstportion to the second portion.
 18. The method of claim 17, wherein theone or more parameters comprises buffer fullness, data arrival, currentbandwidth, or decoding ability, or a combination of two or more.
 19. Themethod of claim 13, wherein the first sequence of pictures has a firstspatial resolution and a first temporal resolution, and each of theplural representations represents a distinct set of pixels of the firstsequence of pictures.
 20. A system, comprising: a first network device,comprising: a memory comprising logic; and a processor configured toexecute the logic to cause the processor to: encode pluralrepresentations having a respective sequence of latticed pictures,wherein a first sequence of pictures has plural contiguous,non-overlapping segments, each of the plural segments having a singlecorresponding segment in each of the plural representations; decode thelatticed pictures of a first segment of the plural encodedrepresentations; form pictures by de-latticing the decodedlatticed-pictures of the first segment; and display the de-latticedpictures of the first segment picture at a resolution corresponding to apicture resolution of 1/p, where p equals the number of plural segments.